=============================================================================== 02009170 <_CORE_RWLock_Release>: */ CORE_RWLock_Status _CORE_RWLock_Release( CORE_RWLock_Control *the_rwlock ) { 2009170: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing = _Thread_Executing; 2009174: 03 00 80 68 sethi %hi(0x201a000), %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 ); 2009178: 7f ff e9 4e call 20036b0 200917c: fa 00 62 04 ld [ %g1 + 0x204 ], %i5 ! 201a204 <_Per_CPU_Information+0xc> 2009180: 84 10 00 08 mov %o0, %g2 if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){ 2009184: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 2009188: 80 a0 60 00 cmp %g1, 0 200918c: 12 80 00 08 bne 20091ac <_CORE_RWLock_Release+0x3c> 2009190: 80 a0 60 01 cmp %g1, 1 _ISR_Enable( level ); 2009194: 7f ff e9 4b call 20036c0 2009198: b0 10 20 00 clr %i0 executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; 200919c: 82 10 20 02 mov 2, %g1 20091a0: c2 27 60 34 st %g1, [ %i5 + 0x34 ] 20091a4: 81 c7 e0 08 ret 20091a8: 81 e8 00 00 restore return CORE_RWLOCK_SUCCESSFUL; } if ( the_rwlock->current_state == CORE_RWLOCK_LOCKED_FOR_READING ) { 20091ac: 32 80 00 0b bne,a 20091d8 <_CORE_RWLock_Release+0x68> 20091b0: c0 27 60 34 clr [ %i5 + 0x34 ] the_rwlock->number_of_readers -= 1; 20091b4: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 20091b8: 82 00 7f ff add %g1, -1, %g1 if ( the_rwlock->number_of_readers != 0 ) { 20091bc: 80 a0 60 00 cmp %g1, 0 20091c0: 02 80 00 05 be 20091d4 <_CORE_RWLock_Release+0x64> 20091c4: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* must be unlocked again */ _ISR_Enable( level ); 20091c8: 7f ff e9 3e call 20036c0 20091cc: b0 10 20 00 clr %i0 return CORE_RWLOCK_SUCCESSFUL; 20091d0: 30 80 00 24 b,a 2009260 <_CORE_RWLock_Release+0xf0> } } /* CORE_RWLOCK_LOCKED_FOR_WRITING or READING with readers */ executing->Wait.return_code = CORE_RWLOCK_SUCCESSFUL; 20091d4: 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; 20091d8: c0 26 20 44 clr [ %i0 + 0x44 ] _ISR_Enable( level ); 20091dc: 7f ff e9 39 call 20036c0 20091e0: 90 10 00 02 mov %g2, %o0 next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue ); 20091e4: 40 00 07 7e call 200afdc <_Thread_queue_Dequeue> 20091e8: 90 10 00 18 mov %i0, %o0 if ( next ) { 20091ec: 80 a2 20 00 cmp %o0, 0 20091f0: 22 80 00 1c be,a 2009260 <_CORE_RWLock_Release+0xf0> 20091f4: b0 10 20 00 clr %i0 if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) { 20091f8: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 20091fc: 80 a0 60 01 cmp %g1, 1 2009200: 32 80 00 05 bne,a 2009214 <_CORE_RWLock_Release+0xa4> 2009204: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_WRITING; 2009208: 82 10 20 02 mov 2, %g1 return CORE_RWLOCK_SUCCESSFUL; 200920c: 10 80 00 14 b 200925c <_CORE_RWLock_Release+0xec> 2009210: c2 26 20 44 st %g1, [ %i0 + 0x44 ] } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 2009214: 82 00 60 01 inc %g1 2009218: c2 26 20 48 st %g1, [ %i0 + 0x48 ] the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_READING; 200921c: 82 10 20 01 mov 1, %g1 2009220: c2 26 20 44 st %g1, [ %i0 + 0x44 ] /* * Now see if more readers can be let go. */ while ( 1 ) { next = _Thread_queue_First( &the_rwlock->Wait_queue ); 2009224: 40 00 08 aa call 200b4cc <_Thread_queue_First> 2009228: 90 10 00 18 mov %i0, %o0 if ( !next || 200922c: 92 92 20 00 orcc %o0, 0, %o1 2009230: 22 80 00 0c be,a 2009260 <_CORE_RWLock_Release+0xf0> 2009234: b0 10 20 00 clr %i0 2009238: c2 02 60 30 ld [ %o1 + 0x30 ], %g1 200923c: 80 a0 60 01 cmp %g1, 1 2009240: 02 80 00 07 be 200925c <_CORE_RWLock_Release+0xec> <== NEVER TAKEN 2009244: 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; 2009248: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 200924c: 82 00 60 01 inc %g1 _Thread_queue_Extract( &the_rwlock->Wait_queue, next ); 2009250: 40 00 08 50 call 200b390 <_Thread_queue_Extract> 2009254: c2 26 20 48 st %g1, [ %i0 + 0x48 ] } 2009258: 30 bf ff f3 b,a 2009224 <_CORE_RWLock_Release+0xb4> } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 200925c: b0 10 20 00 clr %i0 2009260: 81 c7 e0 08 ret 2009264: 81 e8 00 00 restore =============================================================================== 02009268 <_CORE_RWLock_Timeout>: void _CORE_RWLock_Timeout( Objects_Id id, void *ignored ) { 2009268: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200926c: 90 10 00 18 mov %i0, %o0 2009270: 40 00 06 8b call 200ac9c <_Thread_Get> 2009274: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2009278: c2 07 bf fc ld [ %fp + -4 ], %g1 200927c: 80 a0 60 00 cmp %g1, 0 2009280: 12 80 00 09 bne 20092a4 <_CORE_RWLock_Timeout+0x3c> <== NEVER TAKEN 2009284: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 2009288: 40 00 08 cf call 200b5c4 <_Thread_queue_Process_timeout> 200928c: 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--; 2009290: 03 00 80 67 sethi %hi(0x2019c00), %g1 2009294: c4 00 60 c0 ld [ %g1 + 0xc0 ], %g2 ! 2019cc0 <_Thread_Dispatch_disable_level> 2009298: 84 00 bf ff add %g2, -1, %g2 200929c: c4 20 60 c0 st %g2, [ %g1 + 0xc0 ] return _Thread_Dispatch_disable_level; 20092a0: c2 00 60 c0 ld [ %g1 + 0xc0 ], %g1 20092a4: 81 c7 e0 08 ret 20092a8: 81 e8 00 00 restore =============================================================================== 0200fc64 <_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 ) { 200fc64: 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; 200fc68: f4 26 20 44 st %i2, [ %i0 + 0x44 ] the_message_queue->number_of_pending_messages = 0; 200fc6c: c0 26 20 48 clr [ %i0 + 0x48 ] the_message_queue->maximum_message_size = maximum_message_size; 200fc70: 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; 200fc74: c0 26 20 60 clr [ %i0 + 0x60 ] the_message_queue->notify_argument = the_argument; 200fc78: 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)) { 200fc7c: 80 8e e0 03 btst 3, %i3 200fc80: 02 80 00 07 be 200fc9c <_CORE_message_queue_Initialize+0x38> 200fc84: ba 10 00 1b mov %i3, %i5 allocated_message_size += sizeof(uint32_t); 200fc88: ba 06 e0 04 add %i3, 4, %i5 allocated_message_size &= ~(sizeof(uint32_t) - 1); 200fc8c: ba 0f 7f fc and %i5, -4, %i5 } if (allocated_message_size < maximum_message_size) 200fc90: 80 a7 40 1b cmp %i5, %i3 200fc94: 0a 80 00 24 bcs 200fd24 <_CORE_message_queue_Initialize+0xc0><== NEVER TAKEN 200fc98: b8 10 20 00 clr %i4 /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ if ( !size_t_mult32_with_overflow( 200fc9c: ba 07 60 14 add %i5, 0x14, %i5 size_t a, size_t b, size_t *c ) { long long x = (long long)a*b; 200fca0: 90 10 20 00 clr %o0 200fca4: 92 10 00 1a mov %i2, %o1 200fca8: 94 10 20 00 clr %o2 200fcac: 96 10 00 1d mov %i5, %o3 200fcb0: 40 00 42 ba call 2020798 <__muldi3> 200fcb4: b8 10 20 00 clr %i4 if ( x > SIZE_MAX ) 200fcb8: 80 a2 20 00 cmp %o0, 0 200fcbc: 34 80 00 1b bg,a 200fd28 <_CORE_message_queue_Initialize+0xc4> 200fcc0: b0 0f 20 01 and %i4, 1, %i0 /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) _Workspace_Allocate( message_buffering_required ); 200fcc4: 40 00 0c 53 call 2012e10 <_Workspace_Allocate> 200fcc8: 90 10 00 09 mov %o1, %o0 return false; /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) 200fccc: d0 26 20 5c st %o0, [ %i0 + 0x5c ] _Workspace_Allocate( message_buffering_required ); if (the_message_queue->message_buffers == 0) 200fcd0: 80 a2 20 00 cmp %o0, 0 200fcd4: 02 80 00 14 be 200fd24 <_CORE_message_queue_Initialize+0xc0> 200fcd8: 92 10 00 08 mov %o0, %o1 /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 200fcdc: 90 06 20 68 add %i0, 0x68, %o0 200fce0: 94 10 00 1a mov %i2, %o2 200fce4: 40 00 16 2c call 2015594 <_Chain_Initialize> 200fce8: 96 10 00 1d mov %i5, %o3 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 ); 200fcec: 82 06 20 50 add %i0, 0x50, %g1 head->next = tail; head->previous = NULL; tail->previous = head; 200fcf0: c2 26 20 58 st %g1, [ %i0 + 0x58 ] allocated_message_size + sizeof( CORE_message_queue_Buffer_control ) ); _Chain_Initialize_empty( &the_message_queue->Pending_messages ); _Thread_queue_Initialize( 200fcf4: c2 06 40 00 ld [ %i1 ], %g1 RTEMS_INLINE_ROUTINE void _Chain_Initialize_empty( Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); 200fcf8: 84 06 20 54 add %i0, 0x54, %g2 200fcfc: 82 18 60 01 xor %g1, 1, %g1 200fd00: 80 a0 00 01 cmp %g0, %g1 head->next = tail; 200fd04: c4 26 20 50 st %g2, [ %i0 + 0x50 ] head->previous = NULL; 200fd08: c0 26 20 54 clr [ %i0 + 0x54 ] 200fd0c: 90 10 00 18 mov %i0, %o0 200fd10: 92 60 3f ff subx %g0, -1, %o1 200fd14: 94 10 20 80 mov 0x80, %o2 200fd18: 96 10 20 06 mov 6, %o3 200fd1c: 40 00 09 e3 call 20124a8 <_Thread_queue_Initialize> 200fd20: b8 10 20 01 mov 1, %i4 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 200fd24: b0 0f 20 01 and %i4, 1, %i0 200fd28: 81 c7 e0 08 ret 200fd2c: 81 e8 00 00 restore =============================================================================== 02007300 <_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 ) { 2007300: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; if ( (the_thread = _Thread_queue_Dequeue(&the_semaphore->Wait_queue)) ) { 2007304: 90 10 00 18 mov %i0, %o0 2007308: 40 00 07 5b call 2009074 <_Thread_queue_Dequeue> 200730c: ba 10 00 18 mov %i0, %i5 2007310: 80 a2 20 00 cmp %o0, 0 2007314: 12 80 00 0e bne 200734c <_CORE_semaphore_Surrender+0x4c> 2007318: b0 10 20 00 clr %i0 if ( !_Objects_Is_local_id( the_thread->Object.id ) ) (*api_semaphore_mp_support) ( the_thread, id ); #endif } else { _ISR_Disable( level ); 200731c: 7f ff eb 98 call 200217c 2007320: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 2007324: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 2007328: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 200732c: 80 a0 40 02 cmp %g1, %g2 2007330: 1a 80 00 05 bcc 2007344 <_CORE_semaphore_Surrender+0x44> <== NEVER TAKEN 2007334: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 2007338: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 200733c: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 2007340: c2 27 60 48 st %g1, [ %i5 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 2007344: 7f ff eb 92 call 200218c 2007348: 01 00 00 00 nop } return status; } 200734c: 81 c7 e0 08 ret 2007350: 81 e8 00 00 restore =============================================================================== 02006028 <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 2006028: 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 ]; 200602c: f8 06 21 58 ld [ %i0 + 0x158 ], %i4 option_set = (rtems_option) the_thread->Wait.option; 2006030: f6 06 20 30 ld [ %i0 + 0x30 ], %i3 _ISR_Disable( level ); 2006034: 7f ff f0 52 call 200217c 2006038: ba 10 00 18 mov %i0, %i5 200603c: b0 10 00 08 mov %o0, %i0 pending_events = api->pending_events; 2006040: c4 07 00 00 ld [ %i4 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 2006044: c6 07 60 24 ld [ %i5 + 0x24 ], %g3 seized_events = _Event_sets_Get( pending_events, event_condition ); /* * No events were seized in this operation */ if ( _Event_sets_Is_empty( seized_events ) ) { 2006048: 82 88 c0 02 andcc %g3, %g2, %g1 200604c: 02 80 00 43 be 2006158 <_Event_Surrender+0x130> 2006050: 01 00 00 00 nop /* * 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() && 2006054: 09 00 80 73 sethi %hi(0x201cc00), %g4 2006058: 88 11 23 e8 or %g4, 0x3e8, %g4 ! 201cfe8 <_Per_CPU_Information> 200605c: f2 01 20 08 ld [ %g4 + 8 ], %i1 2006060: 80 a6 60 00 cmp %i1, 0 2006064: 22 80 00 1d be,a 20060d8 <_Event_Surrender+0xb0> 2006068: c8 07 60 10 ld [ %i5 + 0x10 ], %g4 200606c: c8 01 20 0c ld [ %g4 + 0xc ], %g4 2006070: 80 a7 40 04 cmp %i5, %g4 2006074: 32 80 00 19 bne,a 20060d8 <_Event_Surrender+0xb0> 2006078: c8 07 60 10 ld [ %i5 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 200607c: 09 00 80 74 sethi %hi(0x201d000), %g4 2006080: f2 01 23 e0 ld [ %g4 + 0x3e0 ], %i1 ! 201d3e0 <_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 ) && 2006084: 80 a6 60 02 cmp %i1, 2 2006088: 02 80 00 07 be 20060a4 <_Event_Surrender+0x7c> <== NEVER TAKEN 200608c: 80 a0 40 03 cmp %g1, %g3 ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 2006090: c8 01 23 e0 ld [ %g4 + 0x3e0 ], %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() && _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 2006094: 80 a1 20 01 cmp %g4, 1 2006098: 32 80 00 10 bne,a 20060d8 <_Event_Surrender+0xb0> 200609c: c8 07 60 10 ld [ %i5 + 0x10 ], %g4 (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { if ( seized_events == event_condition || _Options_Is_any(option_set) ) { 20060a0: 80 a0 40 03 cmp %g1, %g3 20060a4: 02 80 00 04 be 20060b4 <_Event_Surrender+0x8c> 20060a8: 80 8e e0 02 btst 2, %i3 20060ac: 02 80 00 2b be 2006158 <_Event_Surrender+0x130> <== NEVER TAKEN 20060b0: 01 00 00 00 nop 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) ); 20060b4: 84 28 80 01 andn %g2, %g1, %g2 api->pending_events = _Event_sets_Clear( pending_events,seized_events ); 20060b8: c4 27 00 00 st %g2, [ %i4 ] the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20060bc: c4 07 60 28 ld [ %i5 + 0x28 ], %g2 _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 ); the_thread->Wait.count = 0; 20060c0: c0 27 60 24 clr [ %i5 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20060c4: c2 20 80 00 st %g1, [ %g2 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 20060c8: 84 10 20 03 mov 3, %g2 20060cc: 03 00 80 74 sethi %hi(0x201d000), %g1 20060d0: c4 20 63 e0 st %g2, [ %g1 + 0x3e0 ] ! 201d3e0 <_Event_Sync_state> 20060d4: 30 80 00 21 b,a 2006158 <_Event_Surrender+0x130> } /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { 20060d8: 80 89 21 00 btst 0x100, %g4 20060dc: 02 80 00 1f be 2006158 <_Event_Surrender+0x130> 20060e0: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 20060e4: 02 80 00 04 be 20060f4 <_Event_Surrender+0xcc> 20060e8: 80 8e e0 02 btst 2, %i3 20060ec: 02 80 00 1b be 2006158 <_Event_Surrender+0x130> <== NEVER TAKEN 20060f0: 01 00 00 00 nop 20060f4: 84 28 80 01 andn %g2, %g1, %g2 api->pending_events = _Event_sets_Clear( pending_events, seized_events ); 20060f8: c4 27 00 00 st %g2, [ %i4 ] the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20060fc: c4 07 60 28 ld [ %i5 + 0x28 ], %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 ); the_thread->Wait.count = 0; 2006100: c0 27 60 24 clr [ %i5 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2006104: c2 20 80 00 st %g1, [ %g2 ] _ISR_Flash( level ); 2006108: 7f ff f0 21 call 200218c 200610c: 90 10 00 18 mov %i0, %o0 2006110: 7f ff f0 1b call 200217c 2006114: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 2006118: c2 07 60 50 ld [ %i5 + 0x50 ], %g1 200611c: 80 a0 60 02 cmp %g1, 2 2006120: 02 80 00 06 be 2006138 <_Event_Surrender+0x110> 2006124: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 2006128: 7f ff f0 19 call 200218c 200612c: 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 ); 2006130: 10 80 00 08 b 2006150 <_Event_Surrender+0x128> 2006134: b2 16 63 f8 or %i1, 0x3f8, %i1 ! 1003fff8 RTEMS_INLINE_ROUTINE void _Watchdog_Deactivate( Watchdog_Control *the_watchdog ) { the_watchdog->state = WATCHDOG_REMOVE_IT; 2006138: c2 27 60 50 st %g1, [ %i5 + 0x50 ] _Thread_Unblock( the_thread ); } else { _Watchdog_Deactivate( &the_thread->Timer ); _ISR_Enable( level ); 200613c: 7f ff f0 14 call 200218c 2006140: 33 04 00 ff sethi %hi(0x1003fc00), %i1 (void) _Watchdog_Remove( &the_thread->Timer ); 2006144: 40 00 0e bf call 2009c40 <_Watchdog_Remove> 2006148: 90 07 60 48 add %i5, 0x48, %o0 200614c: b2 16 63 f8 or %i1, 0x3f8, %i1 2006150: 40 00 0a 0e call 2008988 <_Thread_Clear_state> 2006154: 91 e8 00 1d restore %g0, %i5, %o0 _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 2006158: 7f ff f0 0d call 200218c 200615c: 81 e8 00 00 restore =============================================================================== 02006160 <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 2006160: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 2006164: 90 10 00 18 mov %i0, %o0 2006168: 40 00 0a f3 call 2008d34 <_Thread_Get> 200616c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2006170: c2 07 bf fc ld [ %fp + -4 ], %g1 2006174: 80 a0 60 00 cmp %g1, 0 2006178: 12 80 00 1d bne 20061ec <_Event_Timeout+0x8c> <== NEVER TAKEN 200617c: 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 ); 2006180: 7f ff ef ff call 200217c 2006184: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 2006188: 03 00 80 73 sethi %hi(0x201cc00), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 200618c: c2 00 63 f4 ld [ %g1 + 0x3f4 ], %g1 ! 201cff4 <_Per_CPU_Information+0xc> 2006190: 80 a7 40 01 cmp %i5, %g1 2006194: 12 80 00 09 bne 20061b8 <_Event_Timeout+0x58> 2006198: c0 27 60 24 clr [ %i5 + 0x24 ] if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) 200619c: 03 00 80 74 sethi %hi(0x201d000), %g1 20061a0: c4 00 63 e0 ld [ %g1 + 0x3e0 ], %g2 ! 201d3e0 <_Event_Sync_state> 20061a4: 80 a0 a0 01 cmp %g2, 1 20061a8: 32 80 00 05 bne,a 20061bc <_Event_Timeout+0x5c> 20061ac: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 20061b0: 84 10 20 02 mov 2, %g2 20061b4: c4 20 63 e0 st %g2, [ %g1 + 0x3e0 ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 20061b8: 82 10 20 06 mov 6, %g1 20061bc: c2 27 60 34 st %g1, [ %i5 + 0x34 ] _ISR_Enable( level ); 20061c0: 7f ff ef f3 call 200218c 20061c4: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 20061c8: 90 10 00 1d mov %i5, %o0 20061cc: 13 04 00 ff sethi %hi(0x1003fc00), %o1 20061d0: 40 00 09 ee call 2008988 <_Thread_Clear_state> 20061d4: 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--; 20061d8: 03 00 80 72 sethi %hi(0x201c800), %g1 20061dc: c4 00 62 b0 ld [ %g1 + 0x2b0 ], %g2 ! 201cab0 <_Thread_Dispatch_disable_level> 20061e0: 84 00 bf ff add %g2, -1, %g2 20061e4: c4 20 62 b0 st %g2, [ %g1 + 0x2b0 ] return _Thread_Dispatch_disable_level; 20061e8: c2 00 62 b0 ld [ %g1 + 0x2b0 ], %g1 20061ec: 81 c7 e0 08 ret 20061f0: 81 e8 00 00 restore =============================================================================== 0200c574 <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 200c574: 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; 200c578: c0 27 bf f8 clr [ %fp + -8 ] Heap_Block *extend_last_block = NULL; 200c57c: 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; 200c580: 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; 200c584: e0 06 20 20 ld [ %i0 + 0x20 ], %l0 Heap_Block *merge_above_block = NULL; Heap_Block *link_below_block = NULL; Heap_Block *link_above_block = NULL; Heap_Block *extend_first_block = NULL; Heap_Block *extend_last_block = NULL; uintptr_t const page_size = heap->page_size; 200c588: e2 06 20 10 ld [ %i0 + 0x10 ], %l1 uintptr_t const min_block_size = heap->min_block_size; 200c58c: 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; 200c590: 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 ) { 200c594: 80 a7 40 19 cmp %i5, %i1 200c598: 0a 80 00 9f bcs 200c814 <_Heap_Extend+0x2a0> 200c59c: b8 10 20 00 clr %i4 return false; } extend_area_ok = _Heap_Get_first_and_last_block( 200c5a0: 90 10 00 19 mov %i1, %o0 200c5a4: 92 10 00 1a mov %i2, %o1 200c5a8: 94 10 00 11 mov %l1, %o2 200c5ac: 98 07 bf f8 add %fp, -8, %o4 200c5b0: 7f ff eb 27 call 200724c <_Heap_Get_first_and_last_block> 200c5b4: 9a 07 bf fc add %fp, -4, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 200c5b8: 80 8a 20 ff btst 0xff, %o0 200c5bc: 02 80 00 96 be 200c814 <_Heap_Extend+0x2a0> 200c5c0: b4 10 00 10 mov %l0, %i2 200c5c4: aa 10 20 00 clr %l5 200c5c8: ac 10 20 00 clr %l6 200c5cc: b8 10 20 00 clr %i4 200c5d0: a8 10 20 00 clr %l4 200c5d4: c2 06 20 18 ld [ %i0 + 0x18 ], %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 ( 200c5d8: 80 a0 40 1d cmp %g1, %i5 200c5dc: 1a 80 00 05 bcc 200c5f0 <_Heap_Extend+0x7c> 200c5e0: e6 06 80 00 ld [ %i2 ], %l3 200c5e4: 80 a6 40 13 cmp %i1, %l3 200c5e8: 2a 80 00 8b bcs,a 200c814 <_Heap_Extend+0x2a0> 200c5ec: b8 10 20 00 clr %i4 sub_area_end > extend_area_begin && extend_area_end > sub_area_begin ) { return false; } if ( extend_area_end == sub_area_begin ) { 200c5f0: 80 a7 40 01 cmp %i5, %g1 200c5f4: 02 80 00 06 be 200c60c <_Heap_Extend+0x98> 200c5f8: 80 a7 40 13 cmp %i5, %l3 merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { 200c5fc: 2a 80 00 05 bcs,a 200c610 <_Heap_Extend+0x9c> 200c600: ac 10 00 1a mov %i2, %l6 200c604: 10 80 00 04 b 200c614 <_Heap_Extend+0xa0> 200c608: 90 10 00 13 mov %l3, %o0 200c60c: a8 10 00 1a mov %i2, %l4 200c610: 90 10 00 13 mov %l3, %o0 200c614: 40 00 17 53 call 2012360 <.urem> 200c618: 92 10 00 11 mov %l1, %o1 200c61c: ae 04 ff f8 add %l3, -8, %l7 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200c620: 80 a4 c0 19 cmp %l3, %i1 200c624: 12 80 00 05 bne 200c638 <_Heap_Extend+0xc4> 200c628: 90 25 c0 08 sub %l7, %o0, %o0 start_block->prev_size = extend_area_end; 200c62c: fa 26 80 00 st %i5, [ %i2 ] RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_of_alloc_area( uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) 200c630: 10 80 00 04 b 200c640 <_Heap_Extend+0xcc> 200c634: b8 10 00 08 mov %o0, %i4 merge_above_block = end_block; } else if ( sub_area_end < extend_area_begin ) { 200c638: 2a 80 00 02 bcs,a 200c640 <_Heap_Extend+0xcc> 200c63c: aa 10 00 08 mov %o0, %l5 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 200c640: f4 02 20 04 ld [ %o0 + 4 ], %i2 200c644: b4 0e bf fe and %i2, -2, %i2 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200c648: b4 06 80 08 add %i2, %o0, %i2 link_above_block = end_block; } start_block = _Heap_Block_at( end_block, _Heap_Block_size( end_block ) ); } while ( start_block != first_block ); 200c64c: 80 a6 80 10 cmp %i2, %l0 200c650: 12 bf ff e2 bne 200c5d8 <_Heap_Extend+0x64> 200c654: 82 10 00 1a mov %i2, %g1 if ( extend_area_begin < heap->area_begin ) { 200c658: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200c65c: 80 a6 40 01 cmp %i1, %g1 200c660: 3a 80 00 04 bcc,a 200c670 <_Heap_Extend+0xfc> 200c664: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 200c668: 10 80 00 05 b 200c67c <_Heap_Extend+0x108> 200c66c: f2 26 20 18 st %i1, [ %i0 + 0x18 ] } else if ( heap->area_end < extend_area_end ) { 200c670: 80 a0 40 1d cmp %g1, %i5 200c674: 2a 80 00 02 bcs,a 200c67c <_Heap_Extend+0x108> 200c678: 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; 200c67c: c4 07 bf f8 ld [ %fp + -8 ], %g2 200c680: c2 07 bf fc ld [ %fp + -4 ], %g1 extend_first_block->prev_size = extend_area_end; 200c684: fa 20 80 00 st %i5, [ %g2 ] heap->area_begin = extend_area_begin; } else if ( heap->area_end < extend_area_end ) { heap->area_end = extend_area_end; } extend_first_block_size = 200c688: 86 20 40 02 sub %g1, %g2, %g3 (uintptr_t) extend_last_block - (uintptr_t) extend_first_block; extend_first_block->prev_size = extend_area_end; extend_first_block->size_and_flag = extend_first_block_size | HEAP_PREV_BLOCK_USED; 200c68c: 88 10 e0 01 or %g3, 1, %g4 _Heap_Protection_block_initialize( heap, extend_first_block ); extend_last_block->prev_size = extend_first_block_size; 200c690: c6 20 40 00 st %g3, [ %g1 ] 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 = 200c694: c8 20 a0 04 st %g4, [ %g2 + 4 ] 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 ) { 200c698: c6 06 20 20 ld [ %i0 + 0x20 ], %g3 200c69c: 80 a0 c0 02 cmp %g3, %g2 200c6a0: 08 80 00 04 bleu 200c6b0 <_Heap_Extend+0x13c> 200c6a4: c0 20 60 04 clr [ %g1 + 4 ] heap->first_block = extend_first_block; 200c6a8: 10 80 00 06 b 200c6c0 <_Heap_Extend+0x14c> 200c6ac: c4 26 20 20 st %g2, [ %i0 + 0x20 ] } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { 200c6b0: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 200c6b4: 80 a0 80 01 cmp %g2, %g1 200c6b8: 2a 80 00 02 bcs,a 200c6c0 <_Heap_Extend+0x14c> 200c6bc: c2 26 20 24 st %g1, [ %i0 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200c6c0: 80 a5 20 00 cmp %l4, 0 200c6c4: 02 80 00 14 be 200c714 <_Heap_Extend+0x1a0> 200c6c8: 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; 200c6cc: f4 06 20 10 ld [ %i0 + 0x10 ], %i2 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_up( uintptr_t value, uintptr_t alignment ) { uintptr_t remainder = value % alignment; 200c6d0: 92 10 00 1a mov %i2, %o1 200c6d4: 40 00 17 23 call 2012360 <.urem> 200c6d8: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 200c6dc: 80 a2 20 00 cmp %o0, 0 200c6e0: 02 80 00 04 be 200c6f0 <_Heap_Extend+0x17c> 200c6e4: c2 05 00 00 ld [ %l4 ], %g1 return value - remainder + alignment; 200c6e8: b2 06 40 1a add %i1, %i2, %i1 200c6ec: 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 = 200c6f0: 92 06 7f f8 add %i1, -8, %o1 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; 200c6f4: c2 26 7f f8 st %g1, [ %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 = 200c6f8: 82 25 00 09 sub %l4, %o1, %g1 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; 200c6fc: 82 10 60 01 or %g1, 1, %g1 _Heap_Free_block( heap, new_first_block ); 200c700: 90 10 00 18 mov %i0, %o0 200c704: 7f ff ff 92 call 200c54c <_Heap_Free_block> 200c708: c2 22 60 04 st %g1, [ %o1 + 4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200c70c: 10 80 00 08 b 200c72c <_Heap_Extend+0x1b8> 200c710: 80 a7 20 00 cmp %i4, 0 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 ) { 200c714: 80 a5 a0 00 cmp %l6, 0 200c718: 02 80 00 04 be 200c728 <_Heap_Extend+0x1b4> 200c71c: ac 25 80 01 sub %l6, %g1, %l6 { 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; 200c720: 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 = 200c724: ec 20 60 04 st %l6, [ %g1 + 4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200c728: 80 a7 20 00 cmp %i4, 0 200c72c: 02 80 00 15 be 200c780 <_Heap_Extend+0x20c> 200c730: 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); 200c734: 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( 200c738: ba 27 40 1c sub %i5, %i4, %i5 200c73c: 40 00 17 09 call 2012360 <.urem> 200c740: 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) 200c744: c4 07 20 04 ld [ %i4 + 4 ], %g2 200c748: ba 27 40 08 sub %i5, %o0, %i5 page_size ); Heap_Block *const new_last_block = _Heap_Block_at( last_block, last_block_new_size ); new_last_block->size_and_flag = 200c74c: 82 07 40 1c add %i5, %i4, %g1 (last_block->size_and_flag - last_block_new_size) 200c750: 84 20 80 1d sub %g2, %i5, %g2 | HEAP_PREV_BLOCK_USED; 200c754: 84 10 a0 01 or %g2, 1, %g2 page_size ); Heap_Block *const new_last_block = _Heap_Block_at( last_block, last_block_new_size ); new_last_block->size_and_flag = 200c758: c4 20 60 04 st %g2, [ %g1 + 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; 200c75c: c2 07 20 04 ld [ %i4 + 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 ); 200c760: 90 10 00 18 mov %i0, %o0 200c764: 82 08 60 01 and %g1, 1, %g1 200c768: 92 10 00 1c mov %i4, %o1 block->size_and_flag = size | flag; 200c76c: ba 17 40 01 or %i5, %g1, %i5 200c770: 7f ff ff 77 call 200c54c <_Heap_Free_block> 200c774: fa 27 20 04 st %i5, [ %i4 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200c778: 10 80 00 0f b 200c7b4 <_Heap_Extend+0x240> 200c77c: 80 a7 20 00 cmp %i4, 0 ); } if ( merge_above_block != NULL ) { _Heap_Merge_above( heap, merge_above_block, extend_area_end ); } else if ( link_above_block != NULL ) { 200c780: 80 a5 60 00 cmp %l5, 0 200c784: 02 80 00 0b be 200c7b0 <_Heap_Extend+0x23c> 200c788: 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; 200c78c: c6 05 60 04 ld [ %l5 + 4 ], %g3 _Heap_Link_above( 200c790: c2 07 bf fc ld [ %fp + -4 ], %g1 200c794: 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 ); 200c798: 84 20 80 15 sub %g2, %l5, %g2 block->size_and_flag = size | flag; 200c79c: 84 10 c0 02 or %g3, %g2, %g2 200c7a0: c4 25 60 04 st %g2, [ %l5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 200c7a4: c4 00 60 04 ld [ %g1 + 4 ], %g2 200c7a8: 84 10 a0 01 or %g2, 1, %g2 200c7ac: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200c7b0: 80 a7 20 00 cmp %i4, 0 200c7b4: 32 80 00 09 bne,a 200c7d8 <_Heap_Extend+0x264> 200c7b8: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200c7bc: 80 a5 20 00 cmp %l4, 0 200c7c0: 32 80 00 06 bne,a 200c7d8 <_Heap_Extend+0x264> 200c7c4: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 200c7c8: d2 07 bf f8 ld [ %fp + -8 ], %o1 200c7cc: 7f ff ff 60 call 200c54c <_Heap_Free_block> 200c7d0: 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 200c7d4: 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( 200c7d8: c4 06 20 20 ld [ %i0 + 0x20 ], %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; 200c7dc: c6 00 60 04 ld [ %g1 + 4 ], %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( 200c7e0: 84 20 80 01 sub %g2, %g1, %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; 200c7e4: 86 08 e0 01 and %g3, 1, %g3 block->size_and_flag = size | flag; 200c7e8: 84 10 c0 02 or %g3, %g2, %g2 200c7ec: c4 20 60 04 st %g2, [ %g1 + 4 ] } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200c7f0: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 stats->size += extended_size; if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; 200c7f4: b8 10 20 01 mov 1, %i4 _Heap_Free_block( heap, extend_first_block ); } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200c7f8: a4 20 40 12 sub %g1, %l2, %l2 /* Statistics */ stats->size += extended_size; 200c7fc: c2 06 20 2c ld [ %i0 + 0x2c ], %g1 if ( extended_size_ptr != NULL ) 200c800: 80 a6 e0 00 cmp %i3, 0 _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; /* Statistics */ stats->size += extended_size; 200c804: 82 00 40 12 add %g1, %l2, %g1 if ( extended_size_ptr != NULL ) 200c808: 02 80 00 03 be 200c814 <_Heap_Extend+0x2a0> <== NEVER TAKEN 200c80c: c2 26 20 2c st %g1, [ %i0 + 0x2c ] 200c810: e4 26 c0 00 st %l2, [ %i3 ] *extended_size_ptr = extended_size; return true; } 200c814: b0 0f 20 01 and %i4, 1, %i0 200c818: 81 c7 e0 08 ret 200c81c: 81 e8 00 00 restore =============================================================================== 0200c984 <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200c984: 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 ) { return true; 200c988: 88 10 20 01 mov 1, %g4 /* * 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 ) { 200c98c: 80 a6 60 00 cmp %i1, 0 200c990: 02 80 00 77 be 200cb6c <_Heap_Free+0x1e8> 200c994: 90 10 00 19 mov %i1, %o0 200c998: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200c99c: 40 00 2c 7c call 2017b8c <.urem> 200c9a0: ba 06 7f f8 add %i1, -8, %i5 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 200c9a4: da 06 20 20 ld [ %i0 + 0x20 ], %o5 uintptr_t alloc_begin, uintptr_t page_size ) { return (Heap_Block *) (_Heap_Align_down( alloc_begin, page_size ) - HEAP_BLOCK_HEADER_SIZE); 200c9a8: 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; 200c9ac: 80 a7 40 0d cmp %i5, %o5 200c9b0: 0a 80 00 05 bcs 200c9c4 <_Heap_Free+0x40> 200c9b4: 82 10 20 00 clr %g1 200c9b8: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200c9bc: 80 a0 40 1d cmp %g1, %i5 200c9c0: 82 60 3f ff subx %g0, -1, %g1 } alloc_begin = (uintptr_t) alloc_begin_ptr; block = _Heap_Block_of_alloc_area( alloc_begin, heap->page_size ); if ( !_Heap_Is_block_in_heap( heap, block ) ) { 200c9c4: 80 a0 60 00 cmp %g1, 0 200c9c8: 02 80 00 69 be 200cb6c <_Heap_Free+0x1e8> 200c9cc: 88 10 20 00 clr %g4 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200c9d0: d6 07 60 04 ld [ %i5 + 4 ], %o3 - 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; 200c9d4: 84 0a ff fe and %o3, -2, %g2 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 200c9d8: 82 00 80 1d add %g2, %i5, %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; 200c9dc: 80 a0 40 0d cmp %g1, %o5 200c9e0: 0a 80 00 05 bcs 200c9f4 <_Heap_Free+0x70> <== NEVER TAKEN 200c9e4: 86 10 20 00 clr %g3 200c9e8: c6 06 20 24 ld [ %i0 + 0x24 ], %g3 200c9ec: 80 a0 c0 01 cmp %g3, %g1 200c9f0: 86 60 3f ff subx %g0, -1, %g3 _Heap_Protection_block_check( heap, block ); block_size = _Heap_Block_size( block ); next_block = _Heap_Block_at( block, block_size ); if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { 200c9f4: 80 a0 e0 00 cmp %g3, 0 200c9f8: 02 80 00 5d be 200cb6c <_Heap_Free+0x1e8> <== NEVER TAKEN 200c9fc: 88 10 20 00 clr %g4 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200ca00: de 00 60 04 ld [ %g1 + 4 ], %o7 return false; } _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_prev_used( next_block ) ) { 200ca04: 80 8b e0 01 btst 1, %o7 200ca08: 02 80 00 59 be 200cb6c <_Heap_Free+0x1e8> 200ca0c: 9e 0b ff fe and %o7, -2, %o7 if ( !_Heap_Protection_determine_block_free( heap, block ) ) { return true; } next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block 200ca10: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); 200ca14: 80 a0 40 04 cmp %g1, %g4 200ca18: 02 80 00 07 be 200ca34 <_Heap_Free+0xb0> 200ca1c: 98 10 20 00 clr %o4 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200ca20: 86 00 40 0f add %g1, %o7, %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; 200ca24: c6 00 e0 04 ld [ %g3 + 4 ], %g3 200ca28: 86 08 e0 01 and %g3, 1, %g3 return true; } next_block_size = _Heap_Block_size( next_block ); next_is_free = next_block != heap->last_block && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); 200ca2c: 80 a0 00 03 cmp %g0, %g3 200ca30: 98 60 3f ff subx %g0, -1, %o4 if ( !_Heap_Is_prev_used( block ) ) { 200ca34: 80 8a e0 01 btst 1, %o3 200ca38: 12 80 00 25 bne 200cacc <_Heap_Free+0x148> 200ca3c: 80 8b 20 ff btst 0xff, %o4 uintptr_t const prev_size = block->prev_size; 200ca40: 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); 200ca44: 86 27 40 0b sub %i5, %o3, %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; 200ca48: 80 a0 c0 0d cmp %g3, %o5 200ca4c: 0a 80 00 04 bcs 200ca5c <_Heap_Free+0xd8> <== NEVER TAKEN 200ca50: 94 10 20 00 clr %o2 200ca54: 80 a1 00 03 cmp %g4, %g3 200ca58: 94 60 3f ff subx %g0, -1, %o2 Heap_Block * const prev_block = _Heap_Block_at( block, -prev_size ); if ( !_Heap_Is_block_in_heap( heap, prev_block ) ) { 200ca5c: 80 a2 a0 00 cmp %o2, 0 200ca60: 02 80 00 43 be 200cb6c <_Heap_Free+0x1e8> <== NEVER TAKEN 200ca64: 88 10 20 00 clr %g4 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; 200ca68: da 00 e0 04 ld [ %g3 + 4 ], %o5 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) ) { 200ca6c: 80 8b 60 01 btst 1, %o5 200ca70: 02 80 00 3f be 200cb6c <_Heap_Free+0x1e8> <== NEVER TAKEN 200ca74: 80 8b 20 ff btst 0xff, %o4 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200ca78: 02 80 00 0e be 200cab0 <_Heap_Free+0x12c> 200ca7c: 88 00 80 0b add %g2, %o3, %g4 uintptr_t const size = block_size + prev_size + next_block_size; 200ca80: 9e 01 00 0f add %g4, %o7, %o7 return _Heap_Free_list_tail(heap)->prev; } RTEMS_INLINE_ROUTINE void _Heap_Free_list_remove( Heap_Block *block ) { Heap_Block *next = block->next; 200ca84: c8 00 60 08 ld [ %g1 + 8 ], %g4 Heap_Block *prev = block->prev; 200ca88: c2 00 60 0c ld [ %g1 + 0xc ], %g1 prev->next = next; 200ca8c: c8 20 60 08 st %g4, [ %g1 + 8 ] next->prev = prev; 200ca90: c2 21 20 0c st %g1, [ %g4 + 0xc ] _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; 200ca94: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 200ca98: 82 00 7f ff add %g1, -1, %g1 200ca9c: c2 26 20 38 st %g1, [ %i0 + 0x38 ] prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block = _Heap_Block_at( prev_block, size ); _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; 200caa0: de 23 c0 03 st %o7, [ %o7 + %g3 ] 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; 200caa4: 82 13 e0 01 or %o7, 1, %g1 200caa8: 10 80 00 27 b 200cb44 <_Heap_Free+0x1c0> 200caac: c2 20 e0 04 st %g1, [ %g3 + 4 ] 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; 200cab0: 9e 11 20 01 or %g4, 1, %o7 200cab4: de 20 e0 04 st %o7, [ %g3 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200cab8: c6 00 60 04 ld [ %g1 + 4 ], %g3 next_block->prev_size = size; 200cabc: c8 20 80 1d st %g4, [ %g2 + %i5 ] _HAssert(!_Heap_Is_prev_used( next_block)); next_block->prev_size = size; } else { /* coalesce prev */ uintptr_t const size = block_size + prev_size; prev_block->size_and_flag = size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200cac0: 86 08 ff fe and %g3, -2, %g3 200cac4: 10 80 00 20 b 200cb44 <_Heap_Free+0x1c0> 200cac8: c6 20 60 04 st %g3, [ %g1 + 4 ] next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ 200cacc: 22 80 00 0d be,a 200cb00 <_Heap_Free+0x17c> 200cad0: c6 06 20 08 ld [ %i0 + 8 ], %g3 RTEMS_INLINE_ROUTINE void _Heap_Free_list_replace( Heap_Block *old_block, Heap_Block *new_block ) { Heap_Block *next = old_block->next; 200cad4: c8 00 60 08 ld [ %g1 + 8 ], %g4 Heap_Block *prev = old_block->prev; 200cad8: c2 00 60 0c ld [ %g1 + 0xc ], %g1 new_block->next = next; 200cadc: c8 27 60 08 st %g4, [ %i5 + 8 ] new_block->prev = prev; 200cae0: c2 27 60 0c st %g1, [ %i5 + 0xc ] uintptr_t const size = block_size + next_block_size; 200cae4: 86 03 c0 02 add %o7, %g2, %g3 next->prev = new_block; prev->next = new_block; 200cae8: fa 20 60 08 st %i5, [ %g1 + 8 ] Heap_Block *prev = old_block->prev; new_block->next = next; new_block->prev = prev; next->prev = new_block; 200caec: fa 21 20 0c st %i5, [ %g4 + 0xc ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200caf0: 82 10 e0 01 or %g3, 1, %g1 next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200caf4: c6 20 c0 1d st %g3, [ %g3 + %i5 ] next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ uintptr_t const size = block_size + next_block_size; _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200caf8: 10 80 00 13 b 200cb44 <_Heap_Free+0x1c0> 200cafc: c2 27 60 04 st %g1, [ %i5 + 4 ] ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 200cb00: f0 27 60 0c st %i0, [ %i5 + 0xc ] Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 200cb04: c6 27 60 08 st %g3, [ %i5 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 200cb08: fa 20 e0 0c st %i5, [ %g3 + 0xc ] 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; 200cb0c: 86 10 a0 01 or %g2, 1, %g3 200cb10: c6 27 60 04 st %g3, [ %i5 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200cb14: c6 00 60 04 ld [ %g1 + 4 ], %g3 next_block->prev_size = block_size; 200cb18: c4 20 80 1d st %g2, [ %g2 + %i5 ] } else { /* no coalesce */ /* Add 'block' to the head of the free blocks list as it tends to produce less fragmentation than adding to the tail. */ _Heap_Free_list_insert_after( _Heap_Free_list_head( heap), block ); block->size_and_flag = block_size | HEAP_PREV_BLOCK_USED; next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200cb1c: 86 08 ff fe and %g3, -2, %g3 200cb20: c6 20 60 04 st %g3, [ %g1 + 4 ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200cb24: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 if ( stats->max_free_blocks < stats->free_blocks ) { 200cb28: c6 06 20 3c ld [ %i0 + 0x3c ], %g3 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; 200cb2c: 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; 200cb30: fa 26 20 08 st %i5, [ %i0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 200cb34: 80 a0 c0 01 cmp %g3, %g1 200cb38: 1a 80 00 03 bcc 200cb44 <_Heap_Free+0x1c0> 200cb3c: c2 26 20 38 st %g1, [ %i0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 200cb40: c2 26 20 3c st %g1, [ %i0 + 0x3c ] } } /* Statistics */ --stats->used_blocks; 200cb44: c2 06 20 40 ld [ %i0 + 0x40 ], %g1 ++stats->frees; stats->free_size += block_size; return( true ); 200cb48: 88 10 20 01 mov 1, %g4 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200cb4c: 82 00 7f ff add %g1, -1, %g1 200cb50: c2 26 20 40 st %g1, [ %i0 + 0x40 ] ++stats->frees; 200cb54: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 200cb58: 82 00 60 01 inc %g1 200cb5c: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->free_size += block_size; 200cb60: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 200cb64: 84 00 40 02 add %g1, %g2, %g2 200cb68: c4 26 20 30 st %g2, [ %i0 + 0x30 ] return( true ); } 200cb6c: b0 09 20 01 and %g4, 1, %i0 200cb70: 81 c7 e0 08 ret 200cb74: 81 e8 00 00 restore =============================================================================== 02019bb4 <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 2019bb4: 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); 2019bb8: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 2019bbc: 7f ff f7 f4 call 2017b8c <.urem> 2019bc0: 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 2019bc4: c6 06 20 20 ld [ %i0 + 0x20 ], %g3 RTEMS_INLINE_ROUTINE uintptr_t _Heap_Align_down( uintptr_t value, uintptr_t alignment ) { return value - (value % alignment); 2019bc8: 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); 2019bcc: 90 27 40 08 sub %i5, %o0, %o0 const Heap_Control *heap, const Heap_Block *block ) { return (uintptr_t) block >= (uintptr_t) heap->first_block && (uintptr_t) block <= (uintptr_t) heap->last_block; 2019bd0: 80 a2 00 03 cmp %o0, %g3 2019bd4: 0a 80 00 05 bcs 2019be8 <_Heap_Size_of_alloc_area+0x34> 2019bd8: 84 10 20 00 clr %g2 2019bdc: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 2019be0: 80 a0 40 08 cmp %g1, %o0 2019be4: 84 60 3f ff subx %g0, -1, %g2 uintptr_t const alloc_begin = (uintptr_t) alloc_begin_ptr; Heap_Block *block = _Heap_Block_of_alloc_area( alloc_begin, page_size ); Heap_Block *next_block = NULL; uintptr_t block_size = 0; if ( !_Heap_Is_block_in_heap( heap, block ) ) { 2019be8: 80 a0 a0 00 cmp %g2, 0 2019bec: 02 80 00 15 be 2019c40 <_Heap_Size_of_alloc_area+0x8c> 2019bf0: 82 10 20 00 clr %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; 2019bf4: fa 02 20 04 ld [ %o0 + 4 ], %i5 2019bf8: ba 0f 7f fe and %i5, -2, %i5 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 2019bfc: ba 07 40 08 add %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; 2019c00: 80 a7 40 03 cmp %i5, %g3 2019c04: 0a 80 00 05 bcs 2019c18 <_Heap_Size_of_alloc_area+0x64> <== NEVER TAKEN 2019c08: 84 10 20 00 clr %g2 2019c0c: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 2019c10: 80 a0 40 1d cmp %g1, %i5 2019c14: 84 60 3f ff subx %g0, -1, %g2 } block_size = _Heap_Block_size( block ); next_block = _Heap_Block_at( block, block_size ); if ( 2019c18: 80 a0 a0 00 cmp %g2, 0 2019c1c: 02 80 00 09 be 2019c40 <_Heap_Size_of_alloc_area+0x8c> <== NEVER TAKEN 2019c20: 82 10 20 00 clr %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; 2019c24: c4 07 60 04 ld [ %i5 + 4 ], %g2 !_Heap_Is_block_in_heap( heap, next_block ) || !_Heap_Is_prev_used( next_block ) 2019c28: 80 88 a0 01 btst 1, %g2 2019c2c: 02 80 00 05 be 2019c40 <_Heap_Size_of_alloc_area+0x8c> <== NEVER TAKEN 2019c30: ba 27 40 19 sub %i5, %i1, %i5 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 2019c34: 82 10 20 01 mov 1, %g1 || !_Heap_Is_prev_used( next_block ) ) { return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; 2019c38: ba 07 60 04 add %i5, 4, %i5 2019c3c: fa 26 80 00 st %i5, [ %i2 ] return true; } 2019c40: b0 08 60 01 and %g1, 1, %i0 2019c44: 81 c7 e0 08 ret 2019c48: 81 e8 00 00 restore =============================================================================== 02008148 <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 2008148: 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; 200814c: 3b 00 80 20 sethi %hi(0x2008000), %i5 Heap_Control *heap, int source, bool dump ) { uintptr_t const page_size = heap->page_size; 2008150: f8 06 20 10 ld [ %i0 + 0x10 ], %i4 uintptr_t const min_block_size = heap->min_block_size; 2008154: e0 06 20 14 ld [ %i0 + 0x14 ], %l0 Heap_Block *const first_block = heap->first_block; 2008158: f6 06 20 20 ld [ %i0 + 0x20 ], %i3 Heap_Block *const last_block = heap->last_block; 200815c: 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; 2008160: 80 a6 a0 00 cmp %i2, 0 2008164: 02 80 00 04 be 2008174 <_Heap_Walk+0x2c> 2008168: ba 17 60 f4 or %i5, 0xf4, %i5 200816c: 3b 00 80 20 sethi %hi(0x2008000), %i5 2008170: ba 17 60 fc or %i5, 0xfc, %i5 ! 20080fc <_Heap_Walk_print> if ( !_System_state_Is_up( _System_state_Get() ) ) { 2008174: 03 00 80 61 sethi %hi(0x2018400), %g1 2008178: c4 00 60 94 ld [ %g1 + 0x94 ], %g2 ! 2018494 <_System_state_Current> 200817c: 80 a0 a0 03 cmp %g2, 3 2008180: 12 80 01 24 bne 2008610 <_Heap_Walk+0x4c8> 2008184: 82 10 20 01 mov 1, %g1 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)( 2008188: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 200818c: da 06 20 18 ld [ %i0 + 0x18 ], %o5 2008190: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2008194: f6 23 a0 60 st %i3, [ %sp + 0x60 ] 2008198: e2 23 a0 64 st %l1, [ %sp + 0x64 ] 200819c: c2 06 20 08 ld [ %i0 + 8 ], %g1 20081a0: 90 10 00 19 mov %i1, %o0 20081a4: c2 23 a0 68 st %g1, [ %sp + 0x68 ] 20081a8: c2 06 20 0c ld [ %i0 + 0xc ], %g1 20081ac: 92 10 20 00 clr %o1 20081b0: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 20081b4: 15 00 80 56 sethi %hi(0x2015800), %o2 20081b8: 96 10 00 1c mov %i4, %o3 20081bc: 94 12 a0 00 mov %o2, %o2 20081c0: 9f c7 40 00 call %i5 20081c4: 98 10 00 10 mov %l0, %o4 heap->area_begin, heap->area_end, first_block, last_block, first_free_block, last_free_block ); if ( page_size == 0 ) { 20081c8: 80 a7 20 00 cmp %i4, 0 20081cc: 12 80 00 07 bne 20081e8 <_Heap_Walk+0xa0> 20081d0: 80 8f 20 07 btst 7, %i4 (*printer)( source, true, "page size is zero\n" ); 20081d4: 15 00 80 56 sethi %hi(0x2015800), %o2 20081d8: 90 10 00 19 mov %i1, %o0 20081dc: 92 10 20 01 mov 1, %o1 20081e0: 10 80 00 32 b 20082a8 <_Heap_Walk+0x160> 20081e4: 94 12 a0 98 or %o2, 0x98, %o2 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 20081e8: 22 80 00 08 be,a 2008208 <_Heap_Walk+0xc0> 20081ec: 90 10 00 10 mov %l0, %o0 (*printer)( 20081f0: 15 00 80 56 sethi %hi(0x2015800), %o2 20081f4: 90 10 00 19 mov %i1, %o0 20081f8: 92 10 20 01 mov 1, %o1 20081fc: 94 12 a0 b0 or %o2, 0xb0, %o2 2008200: 10 80 01 0b b 200862c <_Heap_Walk+0x4e4> 2008204: 96 10 00 1c mov %i4, %o3 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008208: 7f ff e6 36 call 2001ae0 <.urem> 200820c: 92 10 00 1c mov %i4, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 2008210: 80 a2 20 00 cmp %o0, 0 2008214: 22 80 00 08 be,a 2008234 <_Heap_Walk+0xec> 2008218: 90 06 e0 08 add %i3, 8, %o0 (*printer)( 200821c: 15 00 80 56 sethi %hi(0x2015800), %o2 2008220: 90 10 00 19 mov %i1, %o0 2008224: 92 10 20 01 mov 1, %o1 2008228: 94 12 a0 d0 or %o2, 0xd0, %o2 200822c: 10 80 01 00 b 200862c <_Heap_Walk+0x4e4> 2008230: 96 10 00 10 mov %l0, %o3 2008234: 7f ff e6 2b call 2001ae0 <.urem> 2008238: 92 10 00 1c mov %i4, %o1 ); return false; } if ( 200823c: 80 a2 20 00 cmp %o0, 0 2008240: 22 80 00 08 be,a 2008260 <_Heap_Walk+0x118> 2008244: c2 06 e0 04 ld [ %i3 + 4 ], %g1 !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 2008248: 15 00 80 56 sethi %hi(0x2015800), %o2 200824c: 90 10 00 19 mov %i1, %o0 2008250: 92 10 20 01 mov 1, %o1 2008254: 94 12 a0 f8 or %o2, 0xf8, %o2 2008258: 10 80 00 f5 b 200862c <_Heap_Walk+0x4e4> 200825c: 96 10 00 1b mov %i3, %o3 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 2008260: 80 88 60 01 btst 1, %g1 2008264: 32 80 00 07 bne,a 2008280 <_Heap_Walk+0x138> 2008268: f4 04 60 04 ld [ %l1 + 4 ], %i2 (*printer)( 200826c: 15 00 80 56 sethi %hi(0x2015800), %o2 2008270: 90 10 00 19 mov %i1, %o0 2008274: 92 10 20 01 mov 1, %o1 2008278: 10 80 00 0c b 20082a8 <_Heap_Walk+0x160> 200827c: 94 12 a1 30 or %o2, 0x130, %o2 - 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; 2008280: b4 0e bf fe and %i2, -2, %i2 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 2008284: b4 04 40 1a add %l1, %i2, %i2 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; 2008288: c2 06 a0 04 ld [ %i2 + 4 ], %g1 ); return false; } if ( _Heap_Is_free( last_block ) ) { 200828c: 80 88 60 01 btst 1, %g1 2008290: 12 80 00 0a bne 20082b8 <_Heap_Walk+0x170> 2008294: 80 a6 80 1b cmp %i2, %i3 (*printer)( 2008298: 15 00 80 56 sethi %hi(0x2015800), %o2 200829c: 90 10 00 19 mov %i1, %o0 20082a0: 92 10 20 01 mov 1, %o1 20082a4: 94 12 a1 60 or %o2, 0x160, %o2 20082a8: 9f c7 40 00 call %i5 20082ac: 01 00 00 00 nop if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 20082b0: 10 80 00 d8 b 2008610 <_Heap_Walk+0x4c8> 20082b4: 82 10 20 00 clr %g1 ! 0 ); return false; } if ( 20082b8: 02 80 00 06 be 20082d0 <_Heap_Walk+0x188> 20082bc: 15 00 80 56 sethi %hi(0x2015800), %o2 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 20082c0: 90 10 00 19 mov %i1, %o0 20082c4: 92 10 20 01 mov 1, %o1 20082c8: 10 bf ff f8 b 20082a8 <_Heap_Walk+0x160> 20082cc: 94 12 a1 78 or %o2, 0x178, %o2 int source, Heap_Walk_printer printer, Heap_Control *heap ) { uintptr_t const page_size = heap->page_size; 20082d0: e6 06 20 10 ld [ %i0 + 0x10 ], %l3 return &heap->free_list; } RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Free_list_first( Heap_Control *heap ) { return _Heap_Free_list_head(heap)->next; 20082d4: d6 06 20 08 ld [ %i0 + 8 ], %o3 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); 20082d8: 10 80 00 33 b 20083a4 <_Heap_Walk+0x25c> 20082dc: a4 10 00 18 mov %i0, %l2 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; 20082e0: 80 a0 80 0b cmp %g2, %o3 20082e4: 18 80 00 05 bgu 20082f8 <_Heap_Walk+0x1b0> 20082e8: 82 10 20 00 clr %g1 20082ec: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 20082f0: 80 a0 40 0b cmp %g1, %o3 20082f4: 82 60 3f ff subx %g0, -1, %g1 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 ) { if ( !_Heap_Is_block_in_heap( heap, free_block ) ) { 20082f8: 80 a0 60 00 cmp %g1, 0 20082fc: 32 80 00 07 bne,a 2008318 <_Heap_Walk+0x1d0> 2008300: 90 02 e0 08 add %o3, 8, %o0 (*printer)( 2008304: 15 00 80 56 sethi %hi(0x2015800), %o2 2008308: 90 10 00 19 mov %i1, %o0 200830c: 92 10 20 01 mov 1, %o1 2008310: 10 80 00 c7 b 200862c <_Heap_Walk+0x4e4> 2008314: 94 12 a1 a8 or %o2, 0x1a8, %o2 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008318: d6 27 bf f8 st %o3, [ %fp + -8 ] 200831c: 7f ff e5 f1 call 2001ae0 <.urem> 2008320: 92 10 00 13 mov %l3, %o1 ); return false; } if ( 2008324: 80 a2 20 00 cmp %o0, 0 2008328: 02 80 00 07 be 2008344 <_Heap_Walk+0x1fc> 200832c: d6 07 bf f8 ld [ %fp + -8 ], %o3 !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 2008330: 15 00 80 56 sethi %hi(0x2015800), %o2 2008334: 90 10 00 19 mov %i1, %o0 2008338: 92 10 20 01 mov 1, %o1 200833c: 10 80 00 bc b 200862c <_Heap_Walk+0x4e4> 2008340: 94 12 a1 c8 or %o2, 0x1c8, %o2 - 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; 2008344: c2 02 e0 04 ld [ %o3 + 4 ], %g1 2008348: 82 08 7f fe and %g1, -2, %g1 block = next_block; } while ( block != first_block ); return true; } 200834c: 82 02 c0 01 add %o3, %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; 2008350: c2 00 60 04 ld [ %g1 + 4 ], %g1 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008354: 80 88 60 01 btst 1, %g1 2008358: 22 80 00 07 be,a 2008374 <_Heap_Walk+0x22c> 200835c: d8 02 e0 0c ld [ %o3 + 0xc ], %o4 (*printer)( 2008360: 15 00 80 56 sethi %hi(0x2015800), %o2 2008364: 90 10 00 19 mov %i1, %o0 2008368: 92 10 20 01 mov 1, %o1 200836c: 10 80 00 b0 b 200862c <_Heap_Walk+0x4e4> 2008370: 94 12 a1 f8 or %o2, 0x1f8, %o2 ); return false; } if ( free_block->prev != prev_block ) { 2008374: 80 a3 00 12 cmp %o4, %l2 2008378: 22 80 00 0a be,a 20083a0 <_Heap_Walk+0x258> 200837c: a4 10 00 0b mov %o3, %l2 (*printer)( 2008380: 15 00 80 56 sethi %hi(0x2015800), %o2 2008384: 90 10 00 19 mov %i1, %o0 2008388: 92 10 20 01 mov 1, %o1 200838c: 94 12 a2 18 or %o2, 0x218, %o2 2008390: 9f c7 40 00 call %i5 2008394: 01 00 00 00 nop if ( !_System_state_Is_up( _System_state_Get() ) ) { return true; } if ( !_Heap_Walk_check_control( source, printer, heap ) ) { return false; 2008398: 10 80 00 9e b 2008610 <_Heap_Walk+0x4c8> 200839c: 82 10 20 00 clr %g1 ! 0 return false; } prev_block = free_block; free_block = free_block->next; 20083a0: d6 02 e0 08 ld [ %o3 + 8 ], %o3 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 ) { 20083a4: 80 a2 c0 18 cmp %o3, %i0 20083a8: 32 bf ff ce bne,a 20082e0 <_Heap_Walk+0x198> 20083ac: c4 06 20 20 ld [ %i0 + 0x20 ], %g2 20083b0: 2d 00 80 56 sethi %hi(0x2015800), %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)( 20083b4: 2f 00 80 56 sethi %hi(0x2015800), %l7 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 20083b8: ac 15 a3 d8 or %l6, 0x3d8, %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)( 20083bc: ae 15 e3 c0 or %l7, 0x3c0, %l7 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 20083c0: 2b 00 80 56 sethi %hi(0x2015800), %l5 block = next_block; } while ( block != first_block ); return true; } 20083c4: c2 06 a0 04 ld [ %i2 + 4 ], %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; 20083c8: c6 06 20 20 ld [ %i0 + 0x20 ], %g3 - HEAP_BLOCK_HEADER_SIZE); } RTEMS_INLINE_ROUTINE uintptr_t _Heap_Block_size( const Heap_Block *block ) { return block->size_and_flag & ~HEAP_PREV_BLOCK_USED; 20083cc: a4 08 7f fe and %g1, -2, %l2 RTEMS_INLINE_ROUTINE Heap_Block *_Heap_Block_at( const Heap_Block *block, uintptr_t offset ) { return (Heap_Block *) ((uintptr_t) block + offset); 20083d0: a6 04 80 1a add %l2, %i2, %l3 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; 20083d4: 80 a0 c0 13 cmp %g3, %l3 20083d8: 18 80 00 05 bgu 20083ec <_Heap_Walk+0x2a4> <== NEVER TAKEN 20083dc: 84 10 20 00 clr %g2 20083e0: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 20083e4: 80 a0 80 13 cmp %g2, %l3 20083e8: 84 60 3f ff subx %g0, -1, %g2 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; if ( !_Heap_Is_block_in_heap( heap, next_block ) ) { 20083ec: 80 a0 a0 00 cmp %g2, 0 20083f0: 12 80 00 07 bne 200840c <_Heap_Walk+0x2c4> 20083f4: 84 1e 80 11 xor %i2, %l1, %g2 (*printer)( 20083f8: 15 00 80 56 sethi %hi(0x2015800), %o2 20083fc: 90 10 00 19 mov %i1, %o0 2008400: 92 10 20 01 mov 1, %o1 2008404: 10 80 00 2c b 20084b4 <_Heap_Walk+0x36c> 2008408: 94 12 a2 50 or %o2, 0x250, %o2 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; 200840c: 80 a0 00 02 cmp %g0, %g2 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008410: c2 27 bf fc st %g1, [ %fp + -4 ] 2008414: a8 40 20 00 addx %g0, 0, %l4 2008418: 90 10 00 12 mov %l2, %o0 200841c: 7f ff e5 b1 call 2001ae0 <.urem> 2008420: 92 10 00 1c mov %i4, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 2008424: 80 a2 20 00 cmp %o0, 0 2008428: 02 80 00 0c be 2008458 <_Heap_Walk+0x310> 200842c: c2 07 bf fc ld [ %fp + -4 ], %g1 2008430: 80 8d 20 ff btst 0xff, %l4 2008434: 02 80 00 0a be 200845c <_Heap_Walk+0x314> 2008438: 80 a4 80 10 cmp %l2, %l0 (*printer)( 200843c: 15 00 80 56 sethi %hi(0x2015800), %o2 2008440: 90 10 00 19 mov %i1, %o0 2008444: 92 10 20 01 mov 1, %o1 2008448: 94 12 a2 80 or %o2, 0x280, %o2 200844c: 96 10 00 1a mov %i2, %o3 2008450: 10 bf ff d0 b 2008390 <_Heap_Walk+0x248> 2008454: 98 10 00 12 mov %l2, %o4 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 2008458: 80 a4 80 10 cmp %l2, %l0 200845c: 1a 80 00 0d bcc 2008490 <_Heap_Walk+0x348> 2008460: 80 a4 c0 1a cmp %l3, %i2 2008464: 80 8d 20 ff btst 0xff, %l4 2008468: 02 80 00 0a be 2008490 <_Heap_Walk+0x348> <== NEVER TAKEN 200846c: 80 a4 c0 1a cmp %l3, %i2 (*printer)( 2008470: 15 00 80 56 sethi %hi(0x2015800), %o2 2008474: 90 10 00 19 mov %i1, %o0 2008478: 92 10 20 01 mov 1, %o1 200847c: 94 12 a2 b0 or %o2, 0x2b0, %o2 2008480: 96 10 00 1a mov %i2, %o3 2008484: 98 10 00 12 mov %l2, %o4 2008488: 10 80 00 3d b 200857c <_Heap_Walk+0x434> 200848c: 9a 10 00 10 mov %l0, %o5 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 2008490: 38 80 00 0c bgu,a 20084c0 <_Heap_Walk+0x378> 2008494: a8 08 60 01 and %g1, 1, %l4 2008498: 80 8d 20 ff btst 0xff, %l4 200849c: 02 80 00 09 be 20084c0 <_Heap_Walk+0x378> 20084a0: a8 08 60 01 and %g1, 1, %l4 (*printer)( 20084a4: 15 00 80 56 sethi %hi(0x2015800), %o2 20084a8: 90 10 00 19 mov %i1, %o0 20084ac: 92 10 20 01 mov 1, %o1 20084b0: 94 12 a2 e0 or %o2, 0x2e0, %o2 20084b4: 96 10 00 1a mov %i2, %o3 20084b8: 10 bf ff b6 b 2008390 <_Heap_Walk+0x248> 20084bc: 98 10 00 13 mov %l3, %o4 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; 20084c0: c2 04 e0 04 ld [ %l3 + 4 ], %g1 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 20084c4: 80 88 60 01 btst 1, %g1 20084c8: 12 80 00 40 bne 20085c8 <_Heap_Walk+0x480> 20084cc: 90 10 00 19 mov %i1, %o0 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 ? 20084d0: da 06 a0 0c ld [ %i2 + 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)( 20084d4: c2 06 20 08 ld [ %i0 + 8 ], %g1 20084d8: 05 00 80 55 sethi %hi(0x2015400), %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; 20084dc: c8 06 20 0c ld [ %i0 + 0xc ], %g4 20084e0: 80 a3 40 01 cmp %o5, %g1 20084e4: 02 80 00 07 be 2008500 <_Heap_Walk+0x3b8> 20084e8: 86 10 a3 c0 or %g2, 0x3c0, %g3 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 20084ec: 80 a3 40 18 cmp %o5, %i0 20084f0: 12 80 00 04 bne 2008500 <_Heap_Walk+0x3b8> 20084f4: 86 15 63 88 or %l5, 0x388, %g3 20084f8: 07 00 80 55 sethi %hi(0x2015400), %g3 20084fc: 86 10 e3 d0 or %g3, 0x3d0, %g3 ! 20157d0 <_Status_Object_name_errors_to_status+0x48> block->next, block->next == last_free_block ? 2008500: c4 06 a0 08 ld [ %i2 + 8 ], %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)( 2008504: 1f 00 80 55 sethi %hi(0x2015400), %o7 2008508: 80 a0 80 04 cmp %g2, %g4 200850c: 02 80 00 07 be 2008528 <_Heap_Walk+0x3e0> 2008510: 82 13 e3 e0 or %o7, 0x3e0, %g1 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008514: 80 a0 80 18 cmp %g2, %i0 2008518: 12 80 00 04 bne 2008528 <_Heap_Walk+0x3e0> 200851c: 82 15 63 88 or %l5, 0x388, %g1 2008520: 03 00 80 55 sethi %hi(0x2015400), %g1 2008524: 82 10 63 f0 or %g1, 0x3f0, %g1 ! 20157f0 <_Status_Object_name_errors_to_status+0x68> 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)( 2008528: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 200852c: c4 23 a0 60 st %g2, [ %sp + 0x60 ] 2008530: c2 23 a0 64 st %g1, [ %sp + 0x64 ] 2008534: 90 10 00 19 mov %i1, %o0 2008538: 92 10 20 00 clr %o1 200853c: 15 00 80 56 sethi %hi(0x2015800), %o2 2008540: 96 10 00 1a mov %i2, %o3 2008544: 94 12 a3 18 or %o2, 0x318, %o2 2008548: 9f c7 40 00 call %i5 200854c: 98 10 00 12 mov %l2, %o4 block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") ); if ( block_size != next_block->prev_size ) { 2008550: da 04 c0 00 ld [ %l3 ], %o5 2008554: 80 a4 80 0d cmp %l2, %o5 2008558: 02 80 00 0d be 200858c <_Heap_Walk+0x444> 200855c: 80 a5 20 00 cmp %l4, 0 (*printer)( 2008560: 15 00 80 56 sethi %hi(0x2015800), %o2 2008564: e6 23 a0 5c st %l3, [ %sp + 0x5c ] 2008568: 90 10 00 19 mov %i1, %o0 200856c: 92 10 20 01 mov 1, %o1 2008570: 94 12 a3 50 or %o2, 0x350, %o2 2008574: 96 10 00 1a mov %i2, %o3 2008578: 98 10 00 12 mov %l2, %o4 200857c: 9f c7 40 00 call %i5 2008580: 01 00 00 00 nop 2008584: 10 80 00 23 b 2008610 <_Heap_Walk+0x4c8> 2008588: 82 10 20 00 clr %g1 ! 0 ); return false; } if ( !prev_used ) { 200858c: 32 80 00 0a bne,a 20085b4 <_Heap_Walk+0x46c> 2008590: c2 06 20 08 ld [ %i0 + 8 ], %g1 (*printer)( 2008594: 15 00 80 56 sethi %hi(0x2015800), %o2 2008598: 90 10 00 19 mov %i1, %o0 200859c: 92 10 20 01 mov 1, %o1 20085a0: 10 80 00 22 b 2008628 <_Heap_Walk+0x4e0> 20085a4: 94 12 a3 90 or %o2, 0x390, %o2 { 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 ) { if ( free_block == block ) { 20085a8: 02 80 00 17 be 2008604 <_Heap_Walk+0x4bc> 20085ac: 80 a4 c0 1b cmp %l3, %i3 return true; } free_block = free_block->next; 20085b0: 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 ) { 20085b4: 80 a0 40 18 cmp %g1, %i0 20085b8: 12 bf ff fc bne 20085a8 <_Heap_Walk+0x460> 20085bc: 80 a0 40 1a cmp %g1, %i2 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 20085c0: 10 80 00 17 b 200861c <_Heap_Walk+0x4d4> 20085c4: 15 00 80 57 sethi %hi(0x2015c00), %o2 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 20085c8: 80 a5 20 00 cmp %l4, 0 20085cc: 02 80 00 08 be 20085ec <_Heap_Walk+0x4a4> 20085d0: 92 10 20 00 clr %o1 (*printer)( 20085d4: 94 10 00 17 mov %l7, %o2 20085d8: 96 10 00 1a mov %i2, %o3 20085dc: 9f c7 40 00 call %i5 20085e0: 98 10 00 12 mov %l2, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 20085e4: 10 80 00 08 b 2008604 <_Heap_Walk+0x4bc> 20085e8: 80 a4 c0 1b cmp %l3, %i3 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 20085ec: da 06 80 00 ld [ %i2 ], %o5 20085f0: 94 10 00 16 mov %l6, %o2 20085f4: 96 10 00 1a mov %i2, %o3 20085f8: 9f c7 40 00 call %i5 20085fc: 98 10 00 12 mov %l2, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 2008600: 80 a4 c0 1b cmp %l3, %i3 2008604: 12 bf ff 70 bne 20083c4 <_Heap_Walk+0x27c> 2008608: b4 10 00 13 mov %l3, %i2 return true; 200860c: 82 10 20 01 mov 1, %g1 } 2008610: b0 08 60 01 and %g1, 1, %i0 2008614: 81 c7 e0 08 ret 2008618: 81 e8 00 00 restore return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 200861c: 90 10 00 19 mov %i1, %o0 2008620: 92 10 20 01 mov 1, %o1 2008624: 94 12 a0 00 mov %o2, %o2 2008628: 96 10 00 1a mov %i2, %o3 200862c: 9f c7 40 00 call %i5 2008630: 01 00 00 00 nop 2008634: 10 bf ff f7 b 2008610 <_Heap_Walk+0x4c8> 2008638: 82 10 20 00 clr %g1 ! 0 =============================================================================== 02007924 <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 2007924: 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 ) 2007928: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 200792c: 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 ) 2007930: 80 a0 60 00 cmp %g1, 0 2007934: 02 80 00 20 be 20079b4 <_Objects_Allocate+0x90> <== NEVER TAKEN 2007938: 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 ); 200793c: b8 07 60 20 add %i5, 0x20, %i4 2007940: 7f ff fd 87 call 2006f5c <_Chain_Get> 2007944: 90 10 00 1c mov %i4, %o0 if ( information->auto_extend ) { 2007948: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1 200794c: 80 a0 60 00 cmp %g1, 0 2007950: 02 80 00 19 be 20079b4 <_Objects_Allocate+0x90> 2007954: 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 ) { 2007958: 80 a2 20 00 cmp %o0, 0 200795c: 32 80 00 0a bne,a 2007984 <_Objects_Allocate+0x60> 2007960: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 _Objects_Extend_information( information ); 2007964: 40 00 00 1d call 20079d8 <_Objects_Extend_information> 2007968: 90 10 00 1d mov %i5, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 200796c: 7f ff fd 7c call 2006f5c <_Chain_Get> 2007970: 90 10 00 1c mov %i4, %o0 } if ( the_object ) { 2007974: b0 92 20 00 orcc %o0, 0, %i0 2007978: 02 80 00 0f be 20079b4 <_Objects_Allocate+0x90> 200797c: 01 00 00 00 nop uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 2007980: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 2007984: d0 16 20 0a lduh [ %i0 + 0xa ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 2007988: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1 200798c: 40 00 3f d4 call 20178dc <.udiv> 2007990: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 2007994: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 2007998: 91 2a 20 02 sll %o0, 2, %o0 200799c: c4 00 40 08 ld [ %g1 + %o0 ], %g2 20079a0: 84 00 bf ff add %g2, -1, %g2 20079a4: c4 20 40 08 st %g2, [ %g1 + %o0 ] information->inactive--; 20079a8: c2 17 60 2c lduh [ %i5 + 0x2c ], %g1 20079ac: 82 00 7f ff add %g1, -1, %g1 20079b0: c2 37 60 2c sth %g1, [ %i5 + 0x2c ] ); } #endif return the_object; } 20079b4: 81 c7 e0 08 ret 20079b8: 81 e8 00 00 restore =============================================================================== 02007d30 <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 2007d30: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 2007d34: 80 a6 60 00 cmp %i1, 0 2007d38: 02 80 00 17 be 2007d94 <_Objects_Get_information+0x64> 2007d3c: 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 ); 2007d40: 40 00 13 8e call 200cb78 <_Objects_API_maximum_class> 2007d44: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 2007d48: 80 a2 20 00 cmp %o0, 0 2007d4c: 02 80 00 12 be 2007d94 <_Objects_Get_information+0x64> 2007d50: 80 a6 40 08 cmp %i1, %o0 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 2007d54: 18 80 00 10 bgu 2007d94 <_Objects_Get_information+0x64> 2007d58: 03 00 80 72 sethi %hi(0x201c800), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 2007d5c: b1 2e 20 02 sll %i0, 2, %i0 2007d60: 82 10 62 18 or %g1, 0x218, %g1 2007d64: c2 00 40 18 ld [ %g1 + %i0 ], %g1 2007d68: 80 a0 60 00 cmp %g1, 0 2007d6c: 02 80 00 0a be 2007d94 <_Objects_Get_information+0x64> <== NEVER TAKEN 2007d70: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 2007d74: fa 00 40 19 ld [ %g1 + %i1 ], %i5 if ( !info ) 2007d78: 80 a7 60 00 cmp %i5, 0 2007d7c: 02 80 00 06 be 2007d94 <_Objects_Get_information+0x64> <== NEVER TAKEN 2007d80: 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 ) 2007d84: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1 return NULL; 2007d88: 80 a0 00 01 cmp %g0, %g1 2007d8c: 82 60 20 00 subx %g0, 0, %g1 2007d90: ba 0f 40 01 and %i5, %g1, %i5 #endif return info; } 2007d94: 81 c7 e0 08 ret 2007d98: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02008864 <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 2008864: 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; 2008868: 92 96 20 00 orcc %i0, 0, %o1 200886c: 12 80 00 06 bne 2008884 <_Objects_Id_to_name+0x20> 2008870: 83 32 60 18 srl %o1, 0x18, %g1 2008874: 03 00 80 78 sethi %hi(0x201e000), %g1 2008878: c2 00 63 d4 ld [ %g1 + 0x3d4 ], %g1 ! 201e3d4 <_Per_CPU_Information+0xc> 200887c: d2 00 60 08 ld [ %g1 + 8 ], %o1 2008880: 83 32 60 18 srl %o1, 0x18, %g1 2008884: 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 ) 2008888: 84 00 7f ff add %g1, -1, %g2 200888c: 80 a0 a0 02 cmp %g2, 2 2008890: 18 80 00 16 bgu 20088e8 <_Objects_Id_to_name+0x84> 2008894: 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 ] ) 2008898: 10 80 00 16 b 20088f0 <_Objects_Id_to_name+0x8c> 200889c: 83 28 60 02 sll %g1, 2, %g1 return OBJECTS_INVALID_ID; the_class = _Objects_Get_class( tmpId ); information = _Objects_Information_table[ the_api ][ the_class ]; 20088a0: 85 28 a0 02 sll %g2, 2, %g2 20088a4: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 20088a8: 80 a2 20 00 cmp %o0, 0 20088ac: 02 80 00 0f be 20088e8 <_Objects_Id_to_name+0x84> <== NEVER TAKEN 20088b0: 01 00 00 00 nop return OBJECTS_INVALID_ID; #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) 20088b4: c2 0a 20 38 ldub [ %o0 + 0x38 ], %g1 20088b8: 80 a0 60 00 cmp %g1, 0 20088bc: 12 80 00 0b bne 20088e8 <_Objects_Id_to_name+0x84> <== NEVER TAKEN 20088c0: 01 00 00 00 nop return OBJECTS_INVALID_ID; #endif the_object = _Objects_Get( information, tmpId, &ignored_location ); 20088c4: 7f ff ff ca call 20087ec <_Objects_Get> 20088c8: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 20088cc: 80 a2 20 00 cmp %o0, 0 20088d0: 02 80 00 06 be 20088e8 <_Objects_Id_to_name+0x84> 20088d4: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 20088d8: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 20088dc: 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(); 20088e0: 40 00 03 7e call 20096d8 <_Thread_Enable_dispatch> 20088e4: c2 26 40 00 st %g1, [ %i1 ] return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; } 20088e8: 81 c7 e0 08 ret 20088ec: 91 e8 00 1d restore %g0, %i5, %o0 the_api = _Objects_Get_API( tmpId ); if ( !_Objects_Is_api_valid( the_api ) ) return OBJECTS_INVALID_ID; if ( !_Objects_Information_table[ the_api ] ) 20088f0: 05 00 80 77 sethi %hi(0x201dc00), %g2 20088f4: 84 10 a1 f8 or %g2, 0x1f8, %g2 ! 201ddf8 <_Objects_Information_table> 20088f8: c2 00 80 01 ld [ %g2 + %g1 ], %g1 20088fc: 80 a0 60 00 cmp %g1, 0 2008900: 12 bf ff e8 bne 20088a0 <_Objects_Id_to_name+0x3c> 2008904: 85 32 60 1b srl %o1, 0x1b, %g2 2008908: 30 bf ff f8 b,a 20088e8 <_Objects_Id_to_name+0x84> =============================================================================== 0200e1bc <_POSIX_Keys_Run_destructors>: */ void _POSIX_Keys_Run_destructors( Thread_Control *thread ) { 200e1bc: 9d e3 bf a0 save %sp, -96, %sp Objects_Maximum thread_index = _Objects_Get_index( thread->Object.id ); 200e1c0: f6 06 20 08 ld [ %i0 + 8 ], %i3 * * Reference: 17.1.1.2 P1003.1c/Draft 10, p. 163, line 99. */ while ( !done ) { Objects_Maximum index = 0; Objects_Maximum max = _POSIX_Keys_Information.maximum; 200e1c4: 39 00 80 73 sethi %hi(0x201cc00), %i4 200e1c8: b5 36 e0 18 srl %i3, 0x18, %i2 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 ]; 200e1cc: b7 2e e0 10 sll %i3, 0x10, %i3 200e1d0: b4 0e a0 07 and %i2, 7, %i2 200e1d4: b7 36 e0 0e srl %i3, 0xe, %i3 200e1d8: b4 06 a0 04 add %i2, 4, %i2 200e1dc: b5 2e a0 02 sll %i2, 2, %i2 * * Reference: 17.1.1.2 P1003.1c/Draft 10, p. 163, line 99. */ while ( !done ) { Objects_Maximum index = 0; Objects_Maximum max = _POSIX_Keys_Information.maximum; 200e1e0: 82 17 22 c8 or %i4, 0x2c8, %g1 done = true; for ( index = 1 ; index <= max ; ++index ) { 200e1e4: ba 10 20 01 mov 1, %i5 */ while ( !done ) { Objects_Maximum index = 0; Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; 200e1e8: 84 10 20 01 mov 1, %g2 for ( index = 1 ; index <= max ; ++index ) { 200e1ec: 10 80 00 18 b 200e24c <_POSIX_Keys_Run_destructors+0x90> 200e1f0: f2 10 60 10 lduh [ %g1 + 0x10 ], %i1 POSIX_Keys_Control *key = (POSIX_Keys_Control *) _POSIX_Keys_Information.local_table [ index ]; 200e1f4: 86 17 22 c8 or %i4, 0x2c8, %g3 Objects_Maximum max = _POSIX_Keys_Information.maximum; done = true; for ( index = 1 ; index <= max ; ++index ) { POSIX_Keys_Control *key = (POSIX_Keys_Control *) 200e1f8: c6 00 e0 1c ld [ %g3 + 0x1c ], %g3 200e1fc: 83 28 60 02 sll %g1, 2, %g1 200e200: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 _POSIX_Keys_Information.local_table [ index ]; if ( key != NULL && key->destructor != NULL ) { 200e204: 80 a0 60 00 cmp %g1, 0 200e208: 22 80 00 11 be,a 200e24c <_POSIX_Keys_Run_destructors+0x90> 200e20c: ba 07 60 01 inc %i5 200e210: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 200e214: 80 a0 e0 00 cmp %g3, 0 200e218: 02 80 00 0c be 200e248 <_POSIX_Keys_Run_destructors+0x8c> 200e21c: 86 00 40 1a add %g1, %i2, %g3 void *value = key->Values [ thread_api ][ thread_index ]; 200e220: c6 00 e0 04 ld [ %g3 + 4 ], %g3 200e224: d0 00 c0 1b ld [ %g3 + %i3 ], %o0 if ( value != NULL ) { 200e228: 80 a2 20 00 cmp %o0, 0 200e22c: 22 80 00 08 be,a 200e24c <_POSIX_Keys_Run_destructors+0x90><== ALWAYS TAKEN 200e230: ba 07 60 01 inc %i5 key->Values [ thread_api ][ thread_index ] = NULL; 200e234: c0 20 c0 1b clr [ %g3 + %i3 ] <== NOT EXECUTED (*key->destructor)( value ); 200e238: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 <== NOT EXECUTED 200e23c: 9f c0 40 00 call %g1 <== NOT EXECUTED 200e240: 01 00 00 00 nop <== NOT EXECUTED done = false; 200e244: 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 ) { 200e248: ba 07 60 01 inc %i5 200e24c: 83 2f 60 10 sll %i5, 0x10, %g1 200e250: 83 30 60 10 srl %g1, 0x10, %g1 200e254: 80 a0 40 19 cmp %g1, %i1 200e258: 08 bf ff e7 bleu 200e1f4 <_POSIX_Keys_Run_destructors+0x38> 200e25c: 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 ) { 200e260: 02 bf ff e1 be 200e1e4 <_POSIX_Keys_Run_destructors+0x28> <== NEVER TAKEN 200e264: 82 17 22 c8 or %i4, 0x2c8, %g1 done = false; } } } } } 200e268: 81 c7 e0 08 ret 200e26c: 81 e8 00 00 restore =============================================================================== 0200b454 <_POSIX_Message_queue_Receive_support>: size_t msg_len, unsigned int *msg_prio, bool wait, Watchdog_Interval timeout ) { 200b454: 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( 200b458: 11 00 80 9c sethi %hi(0x2027000), %o0 200b45c: 92 10 00 18 mov %i0, %o1 200b460: 90 12 20 9c or %o0, 0x9c, %o0 200b464: 40 00 0c a8 call 200e704 <_Objects_Get> 200b468: 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 ) { 200b46c: c2 07 bf f8 ld [ %fp + -8 ], %g1 200b470: 80 a0 60 00 cmp %g1, 0 200b474: 12 80 00 3f bne 200b570 <_POSIX_Message_queue_Receive_support+0x11c> 200b478: 01 00 00 00 nop case OBJECTS_LOCAL: if ( (the_mq_fd->oflag & O_ACCMODE) == O_WRONLY ) { 200b47c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200b480: 84 08 60 03 and %g1, 3, %g2 200b484: 80 a0 a0 01 cmp %g2, 1 200b488: 32 80 00 08 bne,a 200b4a8 <_POSIX_Message_queue_Receive_support+0x54> 200b48c: d0 02 20 10 ld [ %o0 + 0x10 ], %o0 _Thread_Enable_dispatch(); 200b490: 40 00 10 4d call 200f5c4 <_Thread_Enable_dispatch> 200b494: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EBADF ); 200b498: 40 00 2a 06 call 2015cb0 <__errno> 200b49c: 01 00 00 00 nop 200b4a0: 10 80 00 0b b 200b4cc <_POSIX_Message_queue_Receive_support+0x78> 200b4a4: 82 10 20 09 mov 9, %g1 ! 9 } the_mq = the_mq_fd->Queue; if ( msg_len < the_mq->Message_queue.maximum_message_size ) { 200b4a8: c4 02 20 68 ld [ %o0 + 0x68 ], %g2 200b4ac: 80 a6 80 02 cmp %i2, %g2 200b4b0: 1a 80 00 09 bcc 200b4d4 <_POSIX_Message_queue_Receive_support+0x80> 200b4b4: 84 10 3f ff mov -1, %g2 _Thread_Enable_dispatch(); 200b4b8: 40 00 10 43 call 200f5c4 <_Thread_Enable_dispatch> 200b4bc: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EMSGSIZE ); 200b4c0: 40 00 29 fc call 2015cb0 <__errno> 200b4c4: 01 00 00 00 nop 200b4c8: 82 10 20 7a mov 0x7a, %g1 ! 7a 200b4cc: 10 80 00 27 b 200b568 <_POSIX_Message_queue_Receive_support+0x114> 200b4d0: c2 22 00 00 st %g1, [ %o0 ] /* * Now if something goes wrong, we return a "length" of -1 * to indicate an error. */ length_out = -1; 200b4d4: c4 27 bf fc st %g2, [ %fp + -4 ] /* * A timed receive with a bad time will do a poll regardless. */ if ( wait ) 200b4d8: 80 a7 20 00 cmp %i4, 0 200b4dc: 02 80 00 06 be 200b4f4 <_POSIX_Message_queue_Receive_support+0xa0><== NEVER TAKEN 200b4e0: 98 10 20 00 clr %o4 do_wait = (the_mq_fd->oflag & O_NONBLOCK) ? false : true; 200b4e4: 05 00 00 10 sethi %hi(0x4000), %g2 200b4e8: 82 08 40 02 and %g1, %g2, %g1 200b4ec: 80 a0 00 01 cmp %g0, %g1 200b4f0: 98 60 3f ff subx %g0, -1, %o4 do_wait = wait; /* * Now perform the actual message receive */ _CORE_message_queue_Seize( 200b4f4: 9a 10 00 1d mov %i5, %o5 200b4f8: 90 02 20 1c add %o0, 0x1c, %o0 200b4fc: 92 10 00 18 mov %i0, %o1 200b500: 94 10 00 19 mov %i1, %o2 200b504: 96 07 bf fc add %fp, -4, %o3 200b508: 40 00 08 53 call 200d654 <_CORE_message_queue_Seize> 200b50c: 98 0b 20 01 and %o4, 1, %o4 &length_out, do_wait, timeout ); _Thread_Enable_dispatch(); 200b510: 40 00 10 2d call 200f5c4 <_Thread_Enable_dispatch> 200b514: 3b 00 80 9c sethi %hi(0x2027000), %i5 *msg_prio = _POSIX_Message_queue_Priority_from_core(_Thread_Executing->Wait.count); 200b518: ba 17 61 08 or %i5, 0x108, %i5 ! 2027108 <_Per_CPU_Information> 200b51c: c2 07 60 0c ld [ %i5 + 0xc ], %g1 RTEMS_INLINE_ROUTINE unsigned int _POSIX_Message_queue_Priority_from_core( CORE_message_queue_Submit_types priority ) { /* absolute value without a library dependency */ return ((priority >= 0) ? priority : -priority); 200b520: c6 00 60 24 ld [ %g1 + 0x24 ], %g3 if ( !_Thread_Executing->Wait.return_code ) 200b524: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 200b528: 85 38 e0 1f sra %g3, 0x1f, %g2 200b52c: 86 18 80 03 xor %g2, %g3, %g3 200b530: 84 20 c0 02 sub %g3, %g2, %g2 200b534: 80 a0 60 00 cmp %g1, 0 200b538: 12 80 00 05 bne 200b54c <_POSIX_Message_queue_Receive_support+0xf8> 200b53c: c4 26 c0 00 st %g2, [ %i3 ] return length_out; 200b540: f0 07 bf fc ld [ %fp + -4 ], %i0 200b544: 81 c7 e0 08 ret 200b548: 81 e8 00 00 restore rtems_set_errno_and_return_minus_one( 200b54c: 40 00 29 d9 call 2015cb0 <__errno> 200b550: 01 00 00 00 nop 200b554: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200b558: b8 10 00 08 mov %o0, %i4 200b55c: 40 00 00 9b call 200b7c8 <_POSIX_Message_queue_Translate_core_message_queue_return_code> 200b560: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 200b564: d0 27 00 00 st %o0, [ %i4 ] 200b568: 81 c7 e0 08 ret 200b56c: 91 e8 3f ff restore %g0, -1, %o0 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EBADF ); 200b570: 40 00 29 d0 call 2015cb0 <__errno> 200b574: b0 10 3f ff mov -1, %i0 200b578: 82 10 20 09 mov 9, %g1 200b57c: c2 22 00 00 st %g1, [ %o0 ] } 200b580: 81 c7 e0 08 ret 200b584: 81 e8 00 00 restore =============================================================================== 0200b6d4 <_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 ]; 200b6d4: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 200b6d8: c4 00 60 d8 ld [ %g1 + 0xd8 ], %g2 200b6dc: 80 a0 a0 00 cmp %g2, 0 200b6e0: 12 80 00 13 bne 200b72c <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x58><== NEVER TAKEN 200b6e4: 01 00 00 00 nop 200b6e8: c4 00 60 dc ld [ %g1 + 0xdc ], %g2 200b6ec: 80 a0 a0 01 cmp %g2, 1 200b6f0: 12 80 00 0f bne 200b72c <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x58> 200b6f4: 01 00 00 00 nop thread_support->cancelability_type == PTHREAD_CANCEL_ASYNCHRONOUS && 200b6f8: c2 00 60 e0 ld [ %g1 + 0xe0 ], %g1 200b6fc: 80 a0 60 00 cmp %g1, 0 200b700: 02 80 00 0b be 200b72c <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x58> 200b704: 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--; 200b708: 03 00 80 5c sethi %hi(0x2017000), %g1 200b70c: c4 00 61 20 ld [ %g1 + 0x120 ], %g2 ! 2017120 <_Thread_Dispatch_disable_level> thread_support->cancelation_requested ) { _Thread_Unnest_dispatch(); _POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED ); 200b710: 92 10 3f ff mov -1, %o1 200b714: 84 00 bf ff add %g2, -1, %g2 200b718: c4 20 61 20 st %g2, [ %g1 + 0x120 ] return _Thread_Dispatch_disable_level; 200b71c: c2 00 61 20 ld [ %g1 + 0x120 ], %g1 200b720: 82 13 c0 00 mov %o7, %g1 200b724: 40 00 01 b6 call 200bdfc <_POSIX_Thread_Exit> 200b728: 9e 10 40 00 mov %g1, %o7 } else _Thread_Enable_dispatch(); 200b72c: 82 13 c0 00 mov %o7, %g1 200b730: 7f ff f4 dd call 2008aa4 <_Thread_Enable_dispatch> 200b734: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200ca90 <_POSIX_Thread_Translate_sched_param>: int policy, struct sched_param *param, Thread_CPU_budget_algorithms *budget_algorithm, Thread_CPU_budget_algorithm_callout *budget_callout ) { 200ca90: 9d e3 bf a0 save %sp, -96, %sp if ( !_POSIX_Priority_Is_valid( param->sched_priority ) ) 200ca94: d0 06 40 00 ld [ %i1 ], %o0 200ca98: 7f ff ff f3 call 200ca64 <_POSIX_Priority_Is_valid> 200ca9c: ba 10 00 18 mov %i0, %i5 200caa0: 80 8a 20 ff btst 0xff, %o0 200caa4: 02 80 00 11 be 200cae8 <_POSIX_Thread_Translate_sched_param+0x58><== NEVER TAKEN 200caa8: b0 10 20 16 mov 0x16, %i0 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; 200caac: c0 26 80 00 clr [ %i2 ] *budget_callout = NULL; if ( policy == SCHED_OTHER ) { 200cab0: 80 a7 60 00 cmp %i5, 0 200cab4: 12 80 00 06 bne 200cacc <_POSIX_Thread_Translate_sched_param+0x3c> 200cab8: c0 26 c0 00 clr [ %i3 ] *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 200cabc: 82 10 20 01 mov 1, %g1 200cac0: c2 26 80 00 st %g1, [ %i2 ] return 0; 200cac4: 81 c7 e0 08 ret 200cac8: 91 e8 20 00 restore %g0, 0, %o0 } if ( policy == SCHED_FIFO ) { 200cacc: 80 a7 60 01 cmp %i5, 1 200cad0: 02 80 00 06 be 200cae8 <_POSIX_Thread_Translate_sched_param+0x58> 200cad4: b0 10 20 00 clr %i0 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; return 0; } if ( policy == SCHED_RR ) { 200cad8: 80 a7 60 02 cmp %i5, 2 200cadc: 32 80 00 05 bne,a 200caf0 <_POSIX_Thread_Translate_sched_param+0x60> 200cae0: 80 a7 60 04 cmp %i5, 4 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE; 200cae4: fa 26 80 00 st %i5, [ %i2 ] return 0; 200cae8: 81 c7 e0 08 ret 200caec: 81 e8 00 00 restore } if ( policy == SCHED_SPORADIC ) { 200caf0: 12 bf ff fe bne 200cae8 <_POSIX_Thread_Translate_sched_param+0x58> 200caf4: b0 10 20 16 mov 0x16, %i0 if ( (param->sched_ss_repl_period.tv_sec == 0) && 200caf8: c2 06 60 08 ld [ %i1 + 8 ], %g1 200cafc: 80 a0 60 00 cmp %g1, 0 200cb00: 32 80 00 07 bne,a 200cb1c <_POSIX_Thread_Translate_sched_param+0x8c> 200cb04: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200cb08: c2 06 60 0c ld [ %i1 + 0xc ], %g1 200cb0c: 80 a0 60 00 cmp %g1, 0 200cb10: 02 80 00 1d be 200cb84 <_POSIX_Thread_Translate_sched_param+0xf4> 200cb14: 01 00 00 00 nop (param->sched_ss_repl_period.tv_nsec == 0) ) return EINVAL; if ( (param->sched_ss_init_budget.tv_sec == 0) && 200cb18: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200cb1c: 80 a0 60 00 cmp %g1, 0 200cb20: 12 80 00 06 bne 200cb38 <_POSIX_Thread_Translate_sched_param+0xa8> 200cb24: 01 00 00 00 nop 200cb28: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200cb2c: 80 a0 60 00 cmp %g1, 0 200cb30: 02 bf ff ee be 200cae8 <_POSIX_Thread_Translate_sched_param+0x58> 200cb34: 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 ) < 200cb38: 7f ff f6 23 call 200a3c4 <_Timespec_To_ticks> 200cb3c: 90 06 60 08 add %i1, 8, %o0 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) return EINVAL; 200cb40: 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 ) < 200cb44: ba 10 00 08 mov %o0, %i5 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) 200cb48: 7f ff f6 1f call 200a3c4 <_Timespec_To_ticks> 200cb4c: 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 ) < 200cb50: 80 a7 40 08 cmp %i5, %o0 200cb54: 0a 80 00 0c bcs 200cb84 <_POSIX_Thread_Translate_sched_param+0xf4> 200cb58: 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 ) ) 200cb5c: 7f ff ff c2 call 200ca64 <_POSIX_Priority_Is_valid> 200cb60: d0 06 60 04 ld [ %i1 + 4 ], %o0 200cb64: 80 8a 20 ff btst 0xff, %o0 200cb68: 02 bf ff e0 be 200cae8 <_POSIX_Thread_Translate_sched_param+0x58> 200cb6c: 82 10 20 03 mov 3, %g1 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_CALLOUT; 200cb70: c2 26 80 00 st %g1, [ %i2 ] *budget_callout = _POSIX_Threads_Sporadic_budget_callout; return 0; 200cb74: b0 10 20 00 clr %i0 if ( !_POSIX_Priority_Is_valid( param->sched_ss_low_priority ) ) return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_CALLOUT; *budget_callout = _POSIX_Threads_Sporadic_budget_callout; 200cb78: 03 00 80 19 sethi %hi(0x2006400), %g1 200cb7c: 82 10 62 f0 or %g1, 0x2f0, %g1 ! 20066f0 <_POSIX_Threads_Sporadic_budget_callout> 200cb80: c2 26 c0 00 st %g1, [ %i3 ] return 0; } return EINVAL; } 200cb84: 81 c7 e0 08 ret 200cb88: 81 e8 00 00 restore =============================================================================== 0200bde0 <_POSIX_Threads_Delete_extension>: */ void _POSIX_Threads_Delete_extension( Thread_Control *executing __attribute__((unused)), Thread_Control *deleted ) { 200bde0: 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 ]; 200bde4: f0 06 61 5c ld [ %i1 + 0x15c ], %i0 /* * Run the POSIX cancellation handlers */ _POSIX_Threads_cancel_run( deleted ); 200bde8: 40 00 08 db call 200e154 <_POSIX_Threads_cancel_run> 200bdec: 90 10 00 19 mov %i1, %o0 /* * Run all the key destructors */ _POSIX_Keys_Run_destructors( deleted ); 200bdf0: 90 10 00 19 mov %i1, %o0 200bdf4: 40 00 08 f2 call 200e1bc <_POSIX_Keys_Run_destructors> 200bdf8: 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 )) ) 200bdfc: 10 80 00 03 b 200be08 <_POSIX_Threads_Delete_extension+0x28> 200be00: f8 06 60 28 ld [ %i1 + 0x28 ], %i4 *(void **)the_thread->Wait.return_argument = value_ptr; 200be04: 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 )) ) 200be08: 7f ff f4 9b call 2009074 <_Thread_queue_Dequeue> 200be0c: 90 10 00 1d mov %i5, %o0 200be10: 80 a2 20 00 cmp %o0, 0 200be14: 32 bf ff fc bne,a 200be04 <_POSIX_Threads_Delete_extension+0x24><== NEVER TAKEN 200be18: c2 02 20 28 ld [ %o0 + 0x28 ], %g1 <== NOT EXECUTED *(void **)the_thread->Wait.return_argument = value_ptr; if ( api->schedpolicy == SCHED_SPORADIC ) 200be1c: c2 06 20 84 ld [ %i0 + 0x84 ], %g1 200be20: 80 a0 60 04 cmp %g1, 4 200be24: 32 80 00 05 bne,a 200be38 <_POSIX_Threads_Delete_extension+0x58> 200be28: c0 26 61 5c clr [ %i1 + 0x15c ] (void) _Watchdog_Remove( &api->Sporadic_timer ); 200be2c: 7f ff f7 85 call 2009c40 <_Watchdog_Remove> 200be30: 90 06 20 a8 add %i0, 0xa8, %o0 deleted->API_Extensions[ THREAD_API_POSIX ] = NULL; 200be34: c0 26 61 5c clr [ %i1 + 0x15c ] _Workspace_Free( api ); 200be38: 7f ff f7 f4 call 2009e08 <_Workspace_Free> 200be3c: 81 e8 00 00 restore =============================================================================== 0200643c <_POSIX_Threads_Initialize_user_threads_body>: * * Output parameters: NONE */ void _POSIX_Threads_Initialize_user_threads_body(void) { 200643c: 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; 2006440: 03 00 80 71 sethi %hi(0x201c400), %g1 2006444: 82 10 63 64 or %g1, 0x364, %g1 ! 201c764 maximum = Configuration_POSIX_API.number_of_initialization_threads; 2006448: f6 00 60 30 ld [ %g1 + 0x30 ], %i3 if ( !user_threads || maximum == 0 ) 200644c: 80 a6 e0 00 cmp %i3, 0 2006450: 02 80 00 1b be 20064bc <_POSIX_Threads_Initialize_user_threads_body+0x80><== NEVER TAKEN 2006454: fa 00 60 34 ld [ %g1 + 0x34 ], %i5 2006458: 80 a7 60 00 cmp %i5, 0 200645c: 02 80 00 18 be 20064bc <_POSIX_Threads_Initialize_user_threads_body+0x80><== NEVER TAKEN 2006460: 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 ); 2006464: 40 00 19 ca call 200cb8c 2006468: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setinheritsched( &attr, PTHREAD_EXPLICIT_SCHED ); 200646c: 92 10 20 02 mov 2, %o1 2006470: 40 00 19 d3 call 200cbbc 2006474: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setstacksize(&attr, user_threads[ index ].stack_size); 2006478: d2 07 60 04 ld [ %i5 + 4 ], %o1 200647c: 40 00 19 df call 200cbf8 2006480: 90 07 bf bc add %fp, -68, %o0 status = pthread_create( 2006484: d4 07 40 00 ld [ %i5 ], %o2 2006488: 90 07 bf fc add %fp, -4, %o0 200648c: 92 07 bf bc add %fp, -68, %o1 2006490: 7f ff ff 18 call 20060f0 2006494: 96 10 20 00 clr %o3 &thread_id, &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) 2006498: 94 92 20 00 orcc %o0, 0, %o2 200649c: 22 80 00 05 be,a 20064b0 <_POSIX_Threads_Initialize_user_threads_body+0x74> 20064a0: b8 07 20 01 inc %i4 _Internal_error_Occurred( INTERNAL_ERROR_POSIX_API, true, status ); 20064a4: 90 10 20 02 mov 2, %o0 20064a8: 40 00 07 f0 call 2008468 <_Internal_error_Occurred> 20064ac: 92 10 20 01 mov 1, %o1 * * Setting the attributes explicitly is critical, since we don't want * to inherit the idle tasks attributes. */ for ( index=0 ; index < maximum ; index++ ) { 20064b0: 80 a7 00 1b cmp %i4, %i3 20064b4: 0a bf ff ec bcs 2006464 <_POSIX_Threads_Initialize_user_threads_body+0x28><== NEVER TAKEN 20064b8: ba 07 60 08 add %i5, 8, %i5 20064bc: 81 c7 e0 08 ret 20064c0: 81 e8 00 00 restore =============================================================================== 0200bf50 <_POSIX_Threads_Sporadic_budget_TSR>: */ void _POSIX_Threads_Sporadic_budget_TSR( Objects_Id id __attribute__((unused)), void *argument ) { 200bf50: 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 ]; 200bf54: 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 ); 200bf58: 40 00 03 c9 call 200ce7c <_Timespec_To_ticks> 200bf5c: 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); 200bf60: 03 00 80 6f sethi %hi(0x201bc00), %g1 200bf64: d2 08 61 8c ldub [ %g1 + 0x18c ], %o1 ! 201bd8c 200bf68: c2 07 60 88 ld [ %i5 + 0x88 ], %g1 the_thread->cpu_time_budget = ticks; 200bf6c: d0 26 60 78 st %o0, [ %i1 + 0x78 ] 200bf70: 92 22 40 01 sub %o1, %g1, %o1 */ #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 ) { 200bf74: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 200bf78: 80 a0 60 00 cmp %g1, 0 200bf7c: 12 80 00 08 bne 200bf9c <_POSIX_Threads_Sporadic_budget_TSR+0x4c><== NEVER TAKEN 200bf80: 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 ) { 200bf84: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200bf88: 80 a0 40 09 cmp %g1, %o1 200bf8c: 08 80 00 04 bleu 200bf9c <_POSIX_Threads_Sporadic_budget_TSR+0x4c> 200bf90: 90 10 00 19 mov %i1, %o0 _Thread_Change_priority( the_thread, new_priority, true ); 200bf94: 7f ff f2 37 call 2008870 <_Thread_Change_priority> 200bf98: 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 ); 200bf9c: 40 00 03 b8 call 200ce7c <_Timespec_To_ticks> 200bfa0: 90 07 60 90 add %i5, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200bfa4: 31 00 80 72 sethi %hi(0x201c800), %i0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200bfa8: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200bfac: b0 16 23 6c or %i0, 0x36c, %i0 200bfb0: 7f ff f6 ca call 2009ad8 <_Watchdog_Insert> 200bfb4: 93 ef 60 a8 restore %i5, 0xa8, %o1 =============================================================================== 0200bfb8 <_POSIX_Threads_Sporadic_budget_callout>: ) { POSIX_API_Control *api; uint32_t new_priority; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200bfb8: c4 02 21 5c ld [ %o0 + 0x15c ], %g2 /* * 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 */ 200bfbc: 86 10 3f ff mov -1, %g3 200bfc0: c4 00 a0 8c ld [ %g2 + 0x8c ], %g2 200bfc4: c6 22 20 78 st %g3, [ %o0 + 0x78 ] 200bfc8: 07 00 80 6f sethi %hi(0x201bc00), %g3 200bfcc: d2 08 e1 8c ldub [ %g3 + 0x18c ], %o1 ! 201bd8c 200bfd0: 92 22 40 02 sub %o1, %g2, %o1 */ #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 ) { 200bfd4: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 200bfd8: 80 a0 a0 00 cmp %g2, 0 200bfdc: 12 80 00 09 bne 200c000 <_POSIX_Threads_Sporadic_budget_callout+0x48><== NEVER TAKEN 200bfe0: d2 22 20 18 st %o1, [ %o0 + 0x18 ] /* * 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 ) { 200bfe4: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200bfe8: 80 a0 40 09 cmp %g1, %o1 200bfec: 1a 80 00 05 bcc 200c000 <_POSIX_Threads_Sporadic_budget_callout+0x48><== NEVER TAKEN 200bff0: 94 10 20 01 mov 1, %o2 _Thread_Change_priority( the_thread, new_priority, true ); 200bff4: 82 13 c0 00 mov %o7, %g1 200bff8: 7f ff f2 1e call 2008870 <_Thread_Change_priority> 200bffc: 9e 10 40 00 mov %g1, %o7 200c000: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 02006168 <_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) { 2006168: 9d e3 bf a0 save %sp, -96, %sp bool activated; ptimer = (POSIX_Timer_Control *)data; /* Increment the number of expirations. */ ptimer->overrun = ptimer->overrun + 1; 200616c: c2 06 60 68 ld [ %i1 + 0x68 ], %g1 2006170: 82 00 60 01 inc %g1 2006174: c2 26 60 68 st %g1, [ %i1 + 0x68 ] /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 2006178: c2 06 60 54 ld [ %i1 + 0x54 ], %g1 200617c: 80 a0 60 00 cmp %g1, 0 2006180: 32 80 00 07 bne,a 200619c <_POSIX_Timer_TSR+0x34> 2006184: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 2006188: c2 06 60 58 ld [ %i1 + 0x58 ], %g1 200618c: 80 a0 60 00 cmp %g1, 0 2006190: 02 80 00 0f be 20061cc <_POSIX_Timer_TSR+0x64> <== NEVER TAKEN 2006194: 82 10 20 04 mov 4, %g1 ( ptimer->timer_data.it_interval.tv_nsec != 0 ) ) { activated = _POSIX_Timer_Insert_helper( 2006198: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 200619c: d4 06 60 08 ld [ %i1 + 8 ], %o2 20061a0: 90 06 60 10 add %i1, 0x10, %o0 20061a4: 17 00 80 18 sethi %hi(0x2006000), %o3 20061a8: 98 10 00 19 mov %i1, %o4 20061ac: 40 00 19 75 call 200c780 <_POSIX_Timer_Insert_helper> 20061b0: 96 12 e1 68 or %o3, 0x168, %o3 ptimer->ticks, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) 20061b4: 80 8a 20 ff btst 0xff, %o0 20061b8: 02 80 00 0a be 20061e0 <_POSIX_Timer_TSR+0x78> <== NEVER TAKEN 20061bc: 01 00 00 00 nop return; /* Store the time when the timer was started again */ _TOD_Get( &ptimer->time ); 20061c0: 40 00 05 bd call 20078b4 <_TOD_Get> 20061c4: 90 06 60 6c add %i1, 0x6c, %o0 20061c8: 82 10 20 03 mov 3, %g1 /* * 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 ) ) { 20061cc: d0 06 60 38 ld [ %i1 + 0x38 ], %o0 20061d0: d2 06 60 44 ld [ %i1 + 0x44 ], %o1 20061d4: 40 00 18 58 call 200c334 20061d8: c2 2e 60 3c stb %g1, [ %i1 + 0x3c ] } /* After the signal handler returns, the count of expirations of the * timer must be set to 0. */ ptimer->overrun = 0; 20061dc: c0 26 60 68 clr [ %i1 + 0x68 ] 20061e0: 81 c7 e0 08 ret 20061e4: 81 e8 00 00 restore =============================================================================== 0200e270 <_POSIX_signals_Check_signal>: bool _POSIX_signals_Check_signal( POSIX_API_Control *api, int signo, bool is_global ) { 200e270: 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, 200e274: 98 10 20 01 mov 1, %o4 200e278: 90 10 00 18 mov %i0, %o0 200e27c: 92 10 00 19 mov %i1, %o1 200e280: 94 07 bf f4 add %fp, -12, %o2 200e284: 40 00 00 2e call 200e33c <_POSIX_signals_Clear_signals> 200e288: 96 10 00 1a mov %i2, %o3 200e28c: 80 8a 20 ff btst 0xff, %o0 200e290: 02 80 00 28 be 200e330 <_POSIX_signals_Check_signal+0xc0> 200e294: 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 ) 200e298: 85 2e 60 02 sll %i1, 2, %g2 200e29c: 35 00 80 74 sethi %hi(0x201d000), %i2 200e2a0: b7 2e 60 04 sll %i1, 4, %i3 200e2a4: b4 16 a0 40 or %i2, 0x40, %i2 200e2a8: b6 26 c0 02 sub %i3, %g2, %i3 200e2ac: 84 06 80 1b add %i2, %i3, %g2 200e2b0: fa 00 a0 08 ld [ %g2 + 8 ], %i5 200e2b4: 80 a7 60 01 cmp %i5, 1 200e2b8: 02 80 00 1e be 200e330 <_POSIX_signals_Check_signal+0xc0> <== NEVER TAKEN 200e2bc: 90 07 bf cc add %fp, -52, %o0 return false; /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; 200e2c0: f8 06 20 d0 ld [ %i0 + 0xd0 ], %i4 api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 200e2c4: c2 00 a0 04 ld [ %g2 + 4 ], %g1 200e2c8: 82 10 40 1c or %g1, %i4, %g1 200e2cc: 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, 200e2d0: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e2d4: d2 00 63 f4 ld [ %g1 + 0x3f4 ], %o1 ! 201cff4 <_Per_CPU_Information+0xc> 200e2d8: 94 10 20 28 mov 0x28, %o2 200e2dc: 40 00 04 62 call 200f464 200e2e0: 92 02 60 20 add %o1, 0x20, %o1 sizeof( Thread_Wait_information )); /* * Here, the signal handler function executes */ switch ( _POSIX_signals_Vectors[ signo ].sa_flags ) { 200e2e4: c2 06 80 1b ld [ %i2 + %i3 ], %g1 200e2e8: 80 a0 60 02 cmp %g1, 2 200e2ec: 12 80 00 07 bne 200e308 <_POSIX_signals_Check_signal+0x98> 200e2f0: 90 10 00 19 mov %i1, %o0 case SA_SIGINFO: (*_POSIX_signals_Vectors[ signo ].sa_sigaction)( 200e2f4: 92 07 bf f4 add %fp, -12, %o1 200e2f8: 9f c7 40 00 call %i5 200e2fc: 94 10 20 00 clr %o2 signo, &siginfo_struct, NULL /* context is undefined per 1003.1b-1993, p. 66 */ ); break; 200e300: 10 80 00 05 b 200e314 <_POSIX_signals_Check_signal+0xa4> 200e304: 03 00 80 73 sethi %hi(0x201cc00), %g1 default: (*_POSIX_signals_Vectors[ signo ].sa_handler)( signo ); 200e308: 9f c7 40 00 call %i5 200e30c: 01 00 00 00 nop } /* * Restore the blocking information */ memcpy( &_Thread_Executing->Wait, &stored_thread_wait_information, 200e310: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e314: d0 00 63 f4 ld [ %g1 + 0x3f4 ], %o0 ! 201cff4 <_Per_CPU_Information+0xc> 200e318: 92 07 bf cc add %fp, -52, %o1 200e31c: 90 02 20 20 add %o0, 0x20, %o0 200e320: 40 00 04 51 call 200f464 200e324: 94 10 20 28 mov 0x28, %o2 /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; return true; 200e328: 82 10 20 01 mov 1, %g1 sizeof( Thread_Wait_information )); /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; 200e32c: f8 26 20 d0 st %i4, [ %i0 + 0xd0 ] return true; } 200e330: b0 08 60 01 and %g1, 1, %i0 200e334: 81 c7 e0 08 ret 200e338: 81 e8 00 00 restore =============================================================================== 0200ea50 <_POSIX_signals_Clear_process_signals>: */ void _POSIX_signals_Clear_process_signals( int signo ) { 200ea50: 9d e3 bf a0 save %sp, -96, %sp clear_signal = true; mask = signo_to_mask( signo ); ISR_Level level; _ISR_Disable( level ); 200ea54: 7f ff cd ca call 200217c 200ea58: 01 00 00 00 nop if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { 200ea5c: 85 2e 20 04 sll %i0, 4, %g2 200ea60: 83 2e 20 02 sll %i0, 2, %g1 200ea64: 82 20 80 01 sub %g2, %g1, %g1 200ea68: 05 00 80 74 sethi %hi(0x201d000), %g2 200ea6c: 84 10 a0 40 or %g2, 0x40, %g2 ! 201d040 <_POSIX_signals_Vectors> 200ea70: c4 00 80 01 ld [ %g2 + %g1 ], %g2 200ea74: 80 a0 a0 02 cmp %g2, 2 200ea78: 12 80 00 0a bne 200eaa0 <_POSIX_signals_Clear_process_signals+0x50> 200ea7c: 84 10 20 01 mov 1, %g2 if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) 200ea80: 05 00 80 74 sethi %hi(0x201d000), %g2 200ea84: 84 10 a2 38 or %g2, 0x238, %g2 ! 201d238 <_POSIX_signals_Siginfo> 200ea88: 86 00 40 02 add %g1, %g2, %g3 200ea8c: c2 00 40 02 ld [ %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 ); 200ea90: 86 00 e0 04 add %g3, 4, %g3 200ea94: 80 a0 40 03 cmp %g1, %g3 200ea98: 12 80 00 08 bne 200eab8 <_POSIX_signals_Clear_process_signals+0x68><== NEVER TAKEN 200ea9c: 84 10 20 01 mov 1, %g2 clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; 200eaa0: 03 00 80 74 sethi %hi(0x201d000), %g1 200eaa4: b0 06 3f ff add %i0, -1, %i0 200eaa8: b1 28 80 18 sll %g2, %i0, %i0 200eaac: c4 00 62 34 ld [ %g1 + 0x234 ], %g2 200eab0: b0 28 80 18 andn %g2, %i0, %i0 200eab4: f0 20 62 34 st %i0, [ %g1 + 0x234 ] } _ISR_Enable( level ); 200eab8: 7f ff cd b5 call 200218c 200eabc: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02006c10 <_POSIX_signals_Get_lowest>: sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 2006c10: 82 10 20 1b mov 0x1b, %g1 2006c14: 84 10 20 01 mov 1, %g2 #include #include #include #include int _POSIX_signals_Get_lowest( 2006c18: 86 00 7f ff add %g1, -1, %g3 2006c1c: 87 28 80 03 sll %g2, %g3, %g3 ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 2006c20: 80 88 c0 08 btst %g3, %o0 2006c24: 12 80 00 11 bne 2006c68 <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN 2006c28: 01 00 00 00 nop sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 2006c2c: 82 00 60 01 inc %g1 2006c30: 80 a0 60 20 cmp %g1, 0x20 2006c34: 12 bf ff fa bne 2006c1c <_POSIX_signals_Get_lowest+0xc> 2006c38: 86 00 7f ff add %g1, -1, %g3 2006c3c: 82 10 20 01 mov 1, %g1 2006c40: 84 10 20 01 mov 1, %g2 #include #include #include #include int _POSIX_signals_Get_lowest( 2006c44: 86 00 7f ff add %g1, -1, %g3 2006c48: 87 28 80 03 sll %g2, %g3, %g3 #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 2006c4c: 80 88 c0 08 btst %g3, %o0 2006c50: 12 80 00 06 bne 2006c68 <_POSIX_signals_Get_lowest+0x58> 2006c54: 01 00 00 00 nop */ #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 2006c58: 82 00 60 01 inc %g1 2006c5c: 80 a0 60 1b cmp %g1, 0x1b 2006c60: 12 bf ff fa bne 2006c48 <_POSIX_signals_Get_lowest+0x38> <== ALWAYS TAKEN 2006c64: 86 00 7f ff add %g1, -1, %g3 * a return 0. This routine will NOT be called unless a signal * is pending in the set passed in. */ found_it: return signo; } 2006c68: 81 c3 e0 08 retl 2006c6c: 90 10 00 01 mov %g1, %o0 =============================================================================== 020197d8 <_POSIX_signals_Unblock_thread>: bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 20197d8: 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 ) ) { 20197dc: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 20197e0: 3b 04 00 20 sethi %hi(0x10008000), %i5 static inline sigset_t signo_to_mask( uint32_t sig ) { return 1u << (sig - 1); 20197e4: 84 06 7f ff add %i1, -1, %g2 20197e8: 86 10 20 01 mov 1, %g3 20197ec: 9e 08 40 1d and %g1, %i5, %o7 bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 20197f0: 92 10 00 1a mov %i2, %o1 POSIX_API_Control *api; sigset_t mask; siginfo_t *the_info = NULL; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 20197f4: c8 06 21 5c ld [ %i0 + 0x15c ], %g4 /* * Is the thread is specifically waiting for a signal? */ if ( _States_Is_interruptible_signal( the_thread->current_state ) ) { 20197f8: 80 a3 c0 1d cmp %o7, %i5 20197fc: 12 80 00 1c bne 201986c <_POSIX_signals_Unblock_thread+0x94> 2019800: 85 28 c0 02 sll %g3, %g2, %g2 if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) { 2019804: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 2019808: 80 88 80 01 btst %g2, %g1 201980c: 12 80 00 07 bne 2019828 <_POSIX_signals_Unblock_thread+0x50> 2019810: 82 10 20 04 mov 4, %g1 2019814: c2 01 20 d0 ld [ %g4 + 0xd0 ], %g1 2019818: 80 a8 80 01 andncc %g2, %g1, %g0 201981c: 02 80 00 3f be 2019918 <_POSIX_signals_Unblock_thread+0x140> 2019820: ba 10 20 00 clr %i5 the_thread->Wait.return_code = EINTR; 2019824: 82 10 20 04 mov 4, %g1 2019828: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { 201982c: 80 a2 60 00 cmp %o1, 0 2019830: 12 80 00 07 bne 201984c <_POSIX_signals_Unblock_thread+0x74> 2019834: d0 06 20 28 ld [ %i0 + 0x28 ], %o0 the_info->si_signo = signo; the_info->si_code = SI_USER; 2019838: 82 10 20 01 mov 1, %g1 the_thread->Wait.return_code = EINTR; the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { the_info->si_signo = signo; 201983c: f2 22 00 00 st %i1, [ %o0 ] the_info->si_code = SI_USER; 2019840: c2 22 20 04 st %g1, [ %o0 + 4 ] the_info->si_value.sival_int = 0; 2019844: 10 80 00 04 b 2019854 <_POSIX_signals_Unblock_thread+0x7c> 2019848: c0 22 20 08 clr [ %o0 + 8 ] } else { *the_info = *info; 201984c: 7f ff d7 06 call 200f464 2019850: 94 10 20 0c mov 0xc, %o2 } _Thread_queue_Extract_with_proxy( the_thread ); 2019854: 90 10 00 18 mov %i0, %o0 2019858: 7f ff be f4 call 2009428 <_Thread_queue_Extract_with_proxy> 201985c: ba 10 20 01 mov 1, %i5 2019860: b0 0f 60 01 and %i5, 1, %i0 2019864: 81 c7 e0 08 ret 2019868: 81 e8 00 00 restore } /* * Thread is not waiting due to a sigwait. */ if ( ~api->signals_blocked & mask ) { 201986c: c8 01 20 d0 ld [ %g4 + 0xd0 ], %g4 2019870: 80 a8 80 04 andncc %g2, %g4, %g0 2019874: 02 80 00 29 be 2019918 <_POSIX_signals_Unblock_thread+0x140> 2019878: ba 10 20 00 clr %i5 * 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 ) ) { 201987c: 05 04 00 00 sethi %hi(0x10000000), %g2 2019880: 80 88 40 02 btst %g1, %g2 2019884: 02 80 00 19 be 20198e8 <_POSIX_signals_Unblock_thread+0x110> 2019888: 80 a0 60 00 cmp %g1, 0 the_thread->Wait.return_code = EINTR; 201988c: 84 10 20 04 mov 4, %g2 2019890: c4 26 20 34 st %g2, [ %i0 + 0x34 ] /* * 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) ) 2019894: 05 00 00 ef sethi %hi(0x3bc00), %g2 2019898: 84 10 a2 e0 or %g2, 0x2e0, %g2 ! 3bee0 201989c: 80 88 40 02 btst %g1, %g2 20198a0: 02 80 00 07 be 20198bc <_POSIX_signals_Unblock_thread+0xe4> 20198a4: 80 88 60 08 btst 8, %g1 _Thread_queue_Extract_with_proxy( the_thread ); 20198a8: 7f ff be e0 call 2009428 <_Thread_queue_Extract_with_proxy> 20198ac: 90 10 00 18 mov %i0, %o0 20198b0: b0 0f 60 01 and %i5, 1, %i0 20198b4: 81 c7 e0 08 ret 20198b8: 81 e8 00 00 restore else if ( _States_Is_delaying(the_thread->current_state) ) { 20198bc: 22 80 00 18 be,a 201991c <_POSIX_signals_Unblock_thread+0x144><== NEVER TAKEN 20198c0: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED (void) _Watchdog_Remove( &the_thread->Timer ); 20198c4: 7f ff c0 df call 2009c40 <_Watchdog_Remove> 20198c8: 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 ); 20198cc: 90 10 00 18 mov %i0, %o0 20198d0: 13 04 00 ff sethi %hi(0x1003fc00), %o1 20198d4: 7f ff bc 2d call 2008988 <_Thread_Clear_state> 20198d8: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 20198dc: b0 0f 60 01 and %i5, 1, %i0 20198e0: 81 c7 e0 08 ret 20198e4: 81 e8 00 00 restore _Thread_Unblock( the_thread ); } } else if ( the_thread->current_state == STATES_READY ) { 20198e8: 32 80 00 0d bne,a 201991c <_POSIX_signals_Unblock_thread+0x144><== NEVER TAKEN 20198ec: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 20198f0: 03 00 80 73 sethi %hi(0x201cc00), %g1 20198f4: 82 10 63 e8 or %g1, 0x3e8, %g1 ! 201cfe8 <_Per_CPU_Information> 20198f8: c4 00 60 08 ld [ %g1 + 8 ], %g2 20198fc: 80 a0 a0 00 cmp %g2, 0 2019900: 22 80 00 07 be,a 201991c <_POSIX_signals_Unblock_thread+0x144> 2019904: b0 0f 60 01 and %i5, 1, %i0 2019908: c4 00 60 0c ld [ %g1 + 0xc ], %g2 201990c: 80 a6 00 02 cmp %i0, %g2 2019910: 22 80 00 02 be,a 2019918 <_POSIX_signals_Unblock_thread+0x140><== ALWAYS TAKEN 2019914: c6 28 60 18 stb %g3, [ %g1 + 0x18 ] _Thread_Dispatch_necessary = true; } } return false; } 2019918: b0 0f 60 01 and %i5, 1, %i0 201991c: 81 c7 e0 08 ret 2019920: 81 e8 00 00 restore =============================================================================== 02008e48 <_RBTree_Extract_unprotected>: */ void _RBTree_Extract_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 2008e48: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *leaf, *target; RBTree_Color victim_color; RBTree_Direction dir; if (!the_node) return; 2008e4c: 80 a6 60 00 cmp %i1, 0 2008e50: 02 80 00 73 be 200901c <_RBTree_Extract_unprotected+0x1d4> 2008e54: 01 00 00 00 nop /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { 2008e58: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008e5c: 80 a6 40 01 cmp %i1, %g1 2008e60: 32 80 00 0d bne,a 2008e94 <_RBTree_Extract_unprotected+0x4c> 2008e64: c2 06 20 0c ld [ %i0 + 0xc ], %g1 if (the_node->child[RBT_RIGHT]) 2008e68: c2 06 60 08 ld [ %i1 + 8 ], %g1 2008e6c: 80 a0 60 00 cmp %g1, 0 2008e70: 22 80 00 04 be,a 2008e80 <_RBTree_Extract_unprotected+0x38> 2008e74: c2 06 40 00 ld [ %i1 ], %g1 the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT]; 2008e78: 10 80 00 06 b 2008e90 <_RBTree_Extract_unprotected+0x48> 2008e7c: c2 26 20 08 st %g1, [ %i0 + 8 ] else { the_rbtree->first[RBT_LEFT] = the_node->parent; if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree, 2008e80: 80 a6 00 01 cmp %i0, %g1 2008e84: 12 80 00 03 bne 2008e90 <_RBTree_Extract_unprotected+0x48> 2008e88: c2 26 20 08 st %g1, [ %i0 + 8 ] the_rbtree->first[RBT_LEFT])) the_rbtree->first[RBT_LEFT] = NULL; 2008e8c: c0 26 20 08 clr [ %i0 + 8 ] } } /* check if max needs to be updated: note, min can equal max (1 element) */ if (the_node == the_rbtree->first[RBT_RIGHT]) { 2008e90: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2008e94: 80 a6 40 01 cmp %i1, %g1 2008e98: 12 80 00 0b bne 2008ec4 <_RBTree_Extract_unprotected+0x7c> 2008e9c: c2 06 60 04 ld [ %i1 + 4 ], %g1 if (the_node->child[RBT_LEFT]) 2008ea0: 80 a0 60 00 cmp %g1, 0 2008ea4: 22 80 00 04 be,a 2008eb4 <_RBTree_Extract_unprotected+0x6c> 2008ea8: c4 06 40 00 ld [ %i1 ], %g2 the_rbtree->first[RBT_RIGHT] = the_node->child[RBT_LEFT]; 2008eac: 10 80 00 06 b 2008ec4 <_RBTree_Extract_unprotected+0x7c> 2008eb0: c2 26 20 0c st %g1, [ %i0 + 0xc ] else { the_rbtree->first[RBT_RIGHT] = the_node->parent; if(_RBTree_Are_nodes_equal((RBTree_Node *)the_rbtree, 2008eb4: 80 a6 00 02 cmp %i0, %g2 2008eb8: 12 80 00 03 bne 2008ec4 <_RBTree_Extract_unprotected+0x7c> 2008ebc: c4 26 20 0c st %g2, [ %i0 + 0xc ] the_rbtree->first[RBT_RIGHT])) the_rbtree->first[RBT_RIGHT] = NULL; 2008ec0: c0 26 20 0c clr [ %i0 + 0xc ] * either max in node->child[RBT_LEFT] or min in node->child[RBT_RIGHT], * and replace the_node with the target node. This maintains the binary * search tree property, but may violate the red-black properties. */ if (the_node->child[RBT_LEFT] && the_node->child[RBT_RIGHT]) { 2008ec4: ba 90 60 00 orcc %g1, 0, %i5 2008ec8: 02 80 00 36 be 2008fa0 <_RBTree_Extract_unprotected+0x158> 2008ecc: f8 06 60 08 ld [ %i1 + 8 ], %i4 2008ed0: 80 a7 20 00 cmp %i4, 0 2008ed4: 32 80 00 05 bne,a 2008ee8 <_RBTree_Extract_unprotected+0xa0> 2008ed8: c2 07 60 08 ld [ %i5 + 8 ], %g1 2008edc: 10 80 00 35 b 2008fb0 <_RBTree_Extract_unprotected+0x168> 2008ee0: b8 10 00 01 mov %g1, %i4 target = the_node->child[RBT_LEFT]; /* find max in node->child[RBT_LEFT] */ while (target->child[RBT_RIGHT]) target = target->child[RBT_RIGHT]; 2008ee4: c2 07 60 08 ld [ %i5 + 8 ], %g1 2008ee8: 80 a0 60 00 cmp %g1, 0 2008eec: 32 bf ff fe bne,a 2008ee4 <_RBTree_Extract_unprotected+0x9c> 2008ef0: 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]; 2008ef4: f8 07 60 04 ld [ %i5 + 4 ], %i4 if(leaf) { 2008ef8: 80 a7 20 00 cmp %i4, 0 2008efc: 02 80 00 05 be 2008f10 <_RBTree_Extract_unprotected+0xc8> 2008f00: 01 00 00 00 nop leaf->parent = target->parent; 2008f04: c2 07 40 00 ld [ %i5 ], %g1 2008f08: 10 80 00 04 b 2008f18 <_RBTree_Extract_unprotected+0xd0> 2008f0c: c2 27 00 00 st %g1, [ %i4 ] } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); 2008f10: 7f ff ff 53 call 2008c5c <_RBTree_Extract_validate_unprotected> 2008f14: 90 10 00 1d mov %i5, %o0 } victim_color = target->color; dir = target != target->parent->child[0]; 2008f18: c4 07 40 00 ld [ %i5 ], %g2 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; 2008f1c: c2 07 60 0c ld [ %i5 + 0xc ], %g1 dir = target != target->parent->child[0]; 2008f20: c6 00 a0 04 ld [ %g2 + 4 ], %g3 2008f24: 86 1f 40 03 xor %i5, %g3, %g3 2008f28: 80 a0 00 03 cmp %g0, %g3 2008f2c: 86 40 20 00 addx %g0, 0, %g3 target->parent->child[dir] = leaf; 2008f30: 87 28 e0 02 sll %g3, 2, %g3 2008f34: 84 00 80 03 add %g2, %g3, %g2 2008f38: f8 20 a0 04 st %i4, [ %g2 + 4 ] /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 2008f3c: c4 06 40 00 ld [ %i1 ], %g2 2008f40: c6 00 a0 04 ld [ %g2 + 4 ], %g3 2008f44: 86 1e 40 03 xor %i1, %g3, %g3 2008f48: 80 a0 00 03 cmp %g0, %g3 2008f4c: 86 40 20 00 addx %g0, 0, %g3 the_node->parent->child[dir] = target; 2008f50: 87 28 e0 02 sll %g3, 2, %g3 2008f54: 84 00 80 03 add %g2, %g3, %g2 2008f58: fa 20 a0 04 st %i5, [ %g2 + 4 ] /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; 2008f5c: c4 06 60 08 ld [ %i1 + 8 ], %g2 2008f60: c4 27 60 08 st %g2, [ %i5 + 8 ] if (the_node->child[RBT_RIGHT]) 2008f64: c4 06 60 08 ld [ %i1 + 8 ], %g2 2008f68: 80 a0 a0 00 cmp %g2, 0 2008f6c: 32 80 00 02 bne,a 2008f74 <_RBTree_Extract_unprotected+0x12c><== ALWAYS TAKEN 2008f70: fa 20 80 00 st %i5, [ %g2 ] the_node->child[RBT_RIGHT]->parent = target; target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 2008f74: c4 06 60 04 ld [ %i1 + 4 ], %g2 2008f78: c4 27 60 04 st %g2, [ %i5 + 4 ] if (the_node->child[RBT_LEFT]) 2008f7c: c4 06 60 04 ld [ %i1 + 4 ], %g2 2008f80: 80 a0 a0 00 cmp %g2, 0 2008f84: 32 80 00 02 bne,a 2008f8c <_RBTree_Extract_unprotected+0x144> 2008f88: fa 20 80 00 st %i5, [ %g2 ] /* 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; 2008f8c: c4 06 40 00 ld [ %i1 ], %g2 2008f90: c4 27 40 00 st %g2, [ %i5 ] target->color = the_node->color; 2008f94: c4 06 60 0c ld [ %i1 + 0xc ], %g2 2008f98: 10 80 00 14 b 2008fe8 <_RBTree_Extract_unprotected+0x1a0> 2008f9c: c4 27 60 0c st %g2, [ %i5 + 0xc ] * violated. We will fix it later. * For now we store the color of the node being deleted in victim_color. */ leaf = the_node->child[RBT_LEFT] ? the_node->child[RBT_LEFT] : the_node->child[RBT_RIGHT]; if( leaf ) { 2008fa0: 80 a7 20 00 cmp %i4, 0 2008fa4: 32 80 00 04 bne,a 2008fb4 <_RBTree_Extract_unprotected+0x16c> 2008fa8: c2 06 40 00 ld [ %i1 ], %g1 2008fac: 30 80 00 04 b,a 2008fbc <_RBTree_Extract_unprotected+0x174> leaf->parent = the_node->parent; 2008fb0: c2 06 40 00 ld [ %i1 ], %g1 2008fb4: 10 80 00 04 b 2008fc4 <_RBTree_Extract_unprotected+0x17c> 2008fb8: c2 27 00 00 st %g1, [ %i4 ] } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(the_node); 2008fbc: 7f ff ff 28 call 2008c5c <_RBTree_Extract_validate_unprotected> 2008fc0: 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]; 2008fc4: c4 06 40 00 ld [ %i1 ], %g2 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; 2008fc8: c2 06 60 0c ld [ %i1 + 0xc ], %g1 /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 2008fcc: c6 00 a0 04 ld [ %g2 + 4 ], %g3 2008fd0: 86 1e 40 03 xor %i1, %g3, %g3 2008fd4: 80 a0 00 03 cmp %g0, %g3 2008fd8: 86 40 20 00 addx %g0, 0, %g3 the_node->parent->child[dir] = leaf; 2008fdc: 87 28 e0 02 sll %g3, 2, %g3 2008fe0: 84 00 80 03 add %g2, %g3, %g2 2008fe4: f8 20 a0 04 st %i4, [ %g2 + 4 ] /* 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 */ 2008fe8: 80 a0 60 00 cmp %g1, 0 2008fec: 32 80 00 06 bne,a 2009004 <_RBTree_Extract_unprotected+0x1bc> 2008ff0: c2 06 20 04 ld [ %i0 + 4 ], %g1 if (leaf) { 2008ff4: 80 a7 20 00 cmp %i4, 0 2008ff8: 32 80 00 02 bne,a 2009000 <_RBTree_Extract_unprotected+0x1b8> 2008ffc: 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; 2009000: 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; 2009004: c0 26 60 08 clr [ %i1 + 8 ] 2009008: c0 26 60 04 clr [ %i1 + 4 ] 200900c: 80 a0 60 00 cmp %g1, 0 2009010: 02 80 00 03 be 200901c <_RBTree_Extract_unprotected+0x1d4> 2009014: c0 26 40 00 clr [ %i1 ] 2009018: c0 20 60 0c clr [ %g1 + 0xc ] 200901c: 81 c7 e0 08 ret 2009020: 81 e8 00 00 restore =============================================================================== 02008c5c <_RBTree_Extract_validate_unprotected>: * of the extract operation. */ void _RBTree_Extract_validate_unprotected( RBTree_Node *the_node ) { 2008c5c: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *parent, *sibling; RBTree_Direction dir; parent = the_node->parent; 2008c60: fa 06 00 00 ld [ %i0 ], %i5 if(!parent->parent) return; 2008c64: c2 07 40 00 ld [ %i5 ], %g1 2008c68: 80 a0 60 00 cmp %g1, 0 2008c6c: 02 80 00 6e be 2008e24 <_RBTree_Extract_validate_unprotected+0x1c8> 2008c70: 90 10 00 18 mov %i0, %o0 sibling = _RBTree_Sibling(the_node); 2008c74: 7f ff ff ca call 2008b9c <_RBTree_Sibling> 2008c78: b4 10 20 01 mov 1, %i2 /* continue to correct tree as long as the_node is black and not the root */ while (!_RBTree_Is_red(the_node) && parent->parent) { 2008c7c: 10 80 00 5d b 2008df0 <_RBTree_Extract_validate_unprotected+0x194> 2008c80: c2 06 20 0c ld [ %i0 + 0xc ], %g1 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2008c84: 22 80 00 15 be,a 2008cd8 <_RBTree_Extract_validate_unprotected+0x7c><== NEVER TAKEN 2008c88: c4 02 20 08 ld [ %o0 + 8 ], %g2 <== NOT EXECUTED 2008c8c: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2008c90: 80 a0 60 01 cmp %g1, 1 2008c94: 32 80 00 11 bne,a 2008cd8 <_RBTree_Extract_validate_unprotected+0x7c> 2008c98: c4 02 20 08 ld [ %o0 + 8 ], %g2 * 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; 2008c9c: c2 27 60 0c st %g1, [ %i5 + 0xc ] sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 2008ca0: c2 07 60 04 ld [ %i5 + 4 ], %g1 * 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; 2008ca4: c0 22 20 0c clr [ %o0 + 0xc ] dir = the_node != parent->child[0]; 2008ca8: 82 1e 00 01 xor %i0, %g1, %g1 2008cac: 80 a0 00 01 cmp %g0, %g1 _RBTree_Rotate(parent, dir); 2008cb0: 90 10 00 1d mov %i5, %o0 * update sibling pointer. */ if (_RBTree_Is_red(sibling)) { parent->color = RBT_RED; sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 2008cb4: b8 40 20 00 addx %g0, 0, %i4 _RBTree_Rotate(parent, dir); 2008cb8: 7f ff ff ca call 2008be0 <_RBTree_Rotate> 2008cbc: 92 10 00 1c mov %i4, %o1 sibling = parent->child[!dir]; 2008cc0: 80 a0 00 1c cmp %g0, %i4 2008cc4: 82 60 3f ff subx %g0, -1, %g1 2008cc8: 83 28 60 02 sll %g1, 2, %g1 2008ccc: 82 07 40 01 add %i5, %g1, %g1 2008cd0: d0 00 60 04 ld [ %g1 + 4 ], %o0 } /* sibling is black, see if both of its children are also black. */ if (!_RBTree_Is_red(sibling->child[RBT_RIGHT]) && 2008cd4: c4 02 20 08 ld [ %o0 + 8 ], %g2 2008cd8: 80 a0 a0 00 cmp %g2, 0 2008cdc: 02 80 00 06 be 2008cf4 <_RBTree_Extract_validate_unprotected+0x98> 2008ce0: 82 10 20 00 clr %g1 * This function maintains the properties of the red-black tree. * * @note It does NOT disable interrupts to ensure the atomicity * of the extract operation. */ void _RBTree_Extract_validate_unprotected( 2008ce4: c2 00 a0 0c ld [ %g2 + 0xc ], %g1 2008ce8: 82 18 60 01 xor %g1, 1, %g1 2008cec: 80 a0 00 01 cmp %g0, %g1 2008cf0: 82 60 3f ff subx %g0, -1, %g1 _RBTree_Rotate(parent, dir); sibling = parent->child[!dir]; } /* sibling is black, see if both of its children are also black. */ if (!_RBTree_Is_red(sibling->child[RBT_RIGHT]) && 2008cf4: 80 a0 60 00 cmp %g1, 0 2008cf8: 32 80 00 14 bne,a 2008d48 <_RBTree_Extract_validate_unprotected+0xec> 2008cfc: c2 07 60 04 ld [ %i5 + 4 ], %g1 !_RBTree_Is_red(sibling->child[RBT_LEFT])) { 2008d00: c4 02 20 04 ld [ %o0 + 4 ], %g2 2008d04: 80 a0 a0 00 cmp %g2, 0 2008d08: 02 80 00 07 be 2008d24 <_RBTree_Extract_validate_unprotected+0xc8> 2008d0c: 80 a0 60 00 cmp %g1, 0 * This function maintains the properties of the red-black tree. * * @note It does NOT disable interrupts to ensure the atomicity * of the extract operation. */ void _RBTree_Extract_validate_unprotected( 2008d10: c2 00 a0 0c ld [ %g2 + 0xc ], %g1 2008d14: 82 18 60 01 xor %g1, 1, %g1 2008d18: 80 a0 00 01 cmp %g0, %g1 2008d1c: 82 60 3f ff subx %g0, -1, %g1 _RBTree_Rotate(parent, dir); sibling = parent->child[!dir]; } /* sibling is black, see if both of its children are also black. */ if (!_RBTree_Is_red(sibling->child[RBT_RIGHT]) && 2008d20: 80 a0 60 00 cmp %g1, 0 2008d24: 32 80 00 09 bne,a 2008d48 <_RBTree_Extract_validate_unprotected+0xec> 2008d28: c2 07 60 04 ld [ %i5 + 4 ], %g1 !_RBTree_Is_red(sibling->child[RBT_LEFT])) { sibling->color = RBT_RED; 2008d2c: f4 22 20 0c st %i2, [ %o0 + 0xc ] 2008d30: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2008d34: 80 a0 60 01 cmp %g1, 1 2008d38: 32 80 00 3d bne,a 2008e2c <_RBTree_Extract_validate_unprotected+0x1d0> 2008d3c: f8 07 40 00 ld [ %i5 ], %i4 if (_RBTree_Is_red(parent)) { parent->color = RBT_BLACK; break; 2008d40: 10 80 00 33 b 2008e0c <_RBTree_Extract_validate_unprotected+0x1b0> 2008d44: c0 27 60 0c clr [ %i5 + 0xc ] * 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]; 2008d48: 82 1e 00 01 xor %i0, %g1, %g1 2008d4c: 80 a0 00 01 cmp %g0, %g1 2008d50: b8 40 20 00 addx %g0, 0, %i4 if (!_RBTree_Is_red(sibling->child[!dir])) { 2008d54: 80 a0 00 1c cmp %g0, %i4 2008d58: b6 60 3f ff subx %g0, -1, %i3 2008d5c: 83 2e e0 02 sll %i3, 2, %g1 2008d60: 82 02 00 01 add %o0, %g1, %g1 2008d64: c4 00 60 04 ld [ %g1 + 4 ], %g2 2008d68: 80 a0 a0 00 cmp %g2, 0 2008d6c: 02 80 00 06 be 2008d84 <_RBTree_Extract_validate_unprotected+0x128> 2008d70: 82 10 20 00 clr %g1 * This function maintains the properties of the red-black tree. * * @note It does NOT disable interrupts to ensure the atomicity * of the extract operation. */ void _RBTree_Extract_validate_unprotected( 2008d74: c2 00 a0 0c ld [ %g2 + 0xc ], %g1 2008d78: 82 18 60 01 xor %g1, 1, %g1 2008d7c: 80 a0 00 01 cmp %g0, %g1 2008d80: 82 60 3f ff subx %g0, -1, %g1 * 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]; if (!_RBTree_Is_red(sibling->child[!dir])) { 2008d84: 80 a0 60 00 cmp %g1, 0 2008d88: 32 80 00 0e bne,a 2008dc0 <_RBTree_Extract_validate_unprotected+0x164> 2008d8c: c2 07 60 0c ld [ %i5 + 0xc ], %g1 sibling->color = RBT_RED; 2008d90: 82 10 20 01 mov 1, %g1 2008d94: c2 22 20 0c st %g1, [ %o0 + 0xc ] sibling->child[dir]->color = RBT_BLACK; 2008d98: 83 2f 20 02 sll %i4, 2, %g1 2008d9c: 82 02 00 01 add %o0, %g1, %g1 2008da0: c2 00 60 04 ld [ %g1 + 4 ], %g1 _RBTree_Rotate(sibling, !dir); 2008da4: 92 1f 20 01 xor %i4, 1, %o1 2008da8: 7f ff ff 8e call 2008be0 <_RBTree_Rotate> 2008dac: c0 20 60 0c clr [ %g1 + 0xc ] sibling = parent->child[!dir]; 2008db0: 83 2e e0 02 sll %i3, 2, %g1 2008db4: 82 07 40 01 add %i5, %g1, %g1 2008db8: d0 00 60 04 ld [ %g1 + 4 ], %o0 } sibling->color = parent->color; 2008dbc: c2 07 60 0c ld [ %i5 + 0xc ], %g1 parent->color = RBT_BLACK; sibling->child[!dir]->color = RBT_BLACK; 2008dc0: b7 2e e0 02 sll %i3, 2, %i3 sibling->color = RBT_RED; sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, !dir); sibling = parent->child[!dir]; } sibling->color = parent->color; 2008dc4: c2 22 20 0c st %g1, [ %o0 + 0xc ] parent->color = RBT_BLACK; sibling->child[!dir]->color = RBT_BLACK; 2008dc8: 90 02 00 1b add %o0, %i3, %o0 2008dcc: c2 02 20 04 ld [ %o0 + 4 ], %g1 sibling->child[dir]->color = RBT_BLACK; _RBTree_Rotate(sibling, !dir); sibling = parent->child[!dir]; } sibling->color = parent->color; parent->color = RBT_BLACK; 2008dd0: c0 27 60 0c clr [ %i5 + 0xc ] sibling->child[!dir]->color = RBT_BLACK; 2008dd4: c0 20 60 0c clr [ %g1 + 0xc ] _RBTree_Rotate(parent, dir); 2008dd8: 90 10 00 1d mov %i5, %o0 2008ddc: 7f ff ff 81 call 2008be0 <_RBTree_Rotate> 2008de0: 92 10 00 1c mov %i4, %o1 break; /* done */ 2008de4: 10 80 00 0b b 2008e10 <_RBTree_Extract_validate_unprotected+0x1b4> 2008de8: c2 06 00 00 ld [ %i0 ], %g1 if(!parent->parent) return; sibling = _RBTree_Sibling(the_node); /* continue to correct tree as long as the_node is black and not the root */ while (!_RBTree_Is_red(the_node) && parent->parent) { 2008dec: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2008df0: 80 a0 60 01 cmp %g1, 1 2008df4: 22 80 00 07 be,a 2008e10 <_RBTree_Extract_validate_unprotected+0x1b4> 2008df8: c2 06 00 00 ld [ %i0 ], %g1 2008dfc: c2 07 40 00 ld [ %i5 ], %g1 2008e00: 80 a0 60 00 cmp %g1, 0 2008e04: 12 bf ff a0 bne 2008c84 <_RBTree_Extract_validate_unprotected+0x28> 2008e08: 80 a2 20 00 cmp %o0, 0 sibling->child[!dir]->color = RBT_BLACK; _RBTree_Rotate(parent, dir); break; /* done */ } } /* while */ if(!the_node->parent->parent) the_node->color = RBT_BLACK; 2008e0c: c2 06 00 00 ld [ %i0 ], %g1 2008e10: c2 00 40 00 ld [ %g1 ], %g1 2008e14: 80 a0 60 00 cmp %g1, 0 2008e18: 12 80 00 0a bne 2008e40 <_RBTree_Extract_validate_unprotected+0x1e4> 2008e1c: 01 00 00 00 nop 2008e20: c0 26 20 0c clr [ %i0 + 0xc ] 2008e24: 81 c7 e0 08 ret 2008e28: 81 e8 00 00 restore parent->color = RBT_BLACK; break; } the_node = parent; /* done if parent is red */ parent = the_node->parent; sibling = _RBTree_Sibling(the_node); 2008e2c: 90 10 00 1d mov %i5, %o0 2008e30: 7f ff ff 5b call 2008b9c <_RBTree_Sibling> 2008e34: b0 10 00 1d mov %i5, %i0 2008e38: 10 bf ff ed b 2008dec <_RBTree_Extract_validate_unprotected+0x190> 2008e3c: ba 10 00 1c mov %i4, %i5 2008e40: 81 c7 e0 08 ret 2008e44: 81 e8 00 00 restore =============================================================================== 02009098 <_RBTree_Find>: RBTree_Node *_RBTree_Find( RBTree_Control *the_rbtree, RBTree_Node *search_node ) { 2009098: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); 200909c: 7f ff e7 ec call 200304c 20090a0: ba 10 00 18 mov %i0, %i5 20090a4: b8 10 00 08 mov %o0, %i4 RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Find_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { RBTree_Node* iter_node = the_rbtree->root; 20090a8: 10 80 00 0d b 20090dc <_RBTree_Find+0x44> 20090ac: f0 06 20 04 ld [ %i0 + 4 ], %i0 int compare_result; while (iter_node) { compare_result = the_rbtree->compare_function(the_node, iter_node); 20090b0: 90 10 00 19 mov %i1, %o0 20090b4: 9f c0 40 00 call %g1 20090b8: 92 10 00 18 mov %i0, %o1 if (compare_result == 0) { 20090bc: 80 a2 20 00 cmp %o0, 0 20090c0: 02 80 00 0a be 20090e8 <_RBTree_Find+0x50> 20090c4: 90 38 00 08 xnor %g0, %o0, %o0 return(iter_node); } RBTree_Direction dir = (compare_result != -1); 20090c8: 80 a0 00 08 cmp %g0, %o0 20090cc: 82 40 20 00 addx %g0, 0, %g1 iter_node = iter_node->child[dir]; 20090d0: 83 28 60 02 sll %g1, 2, %g1 20090d4: b0 06 00 01 add %i0, %g1, %i0 20090d8: f0 06 20 04 ld [ %i0 + 4 ], %i0 RBTree_Node *the_node ) { RBTree_Node* iter_node = the_rbtree->root; int compare_result; while (iter_node) { 20090dc: 80 a6 20 00 cmp %i0, 0 20090e0: 32 bf ff f4 bne,a 20090b0 <_RBTree_Find+0x18> <== ALWAYS TAKEN 20090e4: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 return_node = _RBTree_Find_unprotected( the_rbtree, search_node ); _ISR_Enable( level ); 20090e8: 7f ff e7 dd call 200305c 20090ec: 90 10 00 1c mov %i4, %o0 return return_node; } 20090f0: 81 c7 e0 08 ret 20090f4: 81 e8 00 00 restore =============================================================================== 0200938c <_RBTree_Initialize>: void *compare_function, void *starting_address, size_t number_nodes, size_t node_size ) { 200938c: 9d e3 bf a0 save %sp, -96, %sp size_t count; RBTree_Node *next; /* TODO: Error message? */ if (!the_rbtree) return; 2009390: 80 a6 20 00 cmp %i0, 0 2009394: 02 80 00 0f be 20093d0 <_RBTree_Initialize+0x44> <== NEVER TAKEN 2009398: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _RBTree_Initialize_empty( RBTree_Control *the_rbtree, void *compare_function ) { the_rbtree->permanent_null = NULL; 200939c: c0 26 00 00 clr [ %i0 ] the_rbtree->root = NULL; 20093a0: c0 26 20 04 clr [ %i0 + 4 ] the_rbtree->first[0] = NULL; 20093a4: c0 26 20 08 clr [ %i0 + 8 ] the_rbtree->first[1] = NULL; 20093a8: c0 26 20 0c clr [ %i0 + 0xc ] /* could do sanity checks here */ _RBTree_Initialize_empty(the_rbtree, compare_function); count = number_nodes; next = starting_address; while ( count-- ) { 20093ac: 10 80 00 06 b 20093c4 <_RBTree_Initialize+0x38> 20093b0: f2 26 20 10 st %i1, [ %i0 + 0x10 ] _RBTree_Insert(the_rbtree, next); 20093b4: 90 10 00 18 mov %i0, %o0 20093b8: 7f ff ff ec call 2009368 <_RBTree_Insert> 20093bc: b4 06 80 1c add %i2, %i4, %i2 * node_size - size of node in bytes * * Output parameters: NONE */ void _RBTree_Initialize( 20093c0: b6 06 ff ff add %i3, -1, %i3 /* could do sanity checks here */ _RBTree_Initialize_empty(the_rbtree, compare_function); count = number_nodes; next = starting_address; while ( count-- ) { 20093c4: 80 a6 e0 00 cmp %i3, 0 20093c8: 12 bf ff fb bne 20093b4 <_RBTree_Initialize+0x28> 20093cc: 92 10 00 1a mov %i2, %o1 20093d0: 81 c7 e0 08 ret 20093d4: 81 e8 00 00 restore =============================================================================== 020025cc <_RBTree_Sibling>: */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( RBTree_Node *the_node ) { if(!the_node) return NULL; 20025cc: 80 a2 20 00 cmp %o0, 0 20025d0: 02 80 00 0e be 2002608 <_RBTree_Sibling+0x3c> 20025d4: 82 10 20 00 clr %g1 if(!(the_node->parent)) return NULL; 20025d8: c4 02 00 00 ld [ %o0 ], %g2 20025dc: 80 a0 a0 00 cmp %g2, 0 20025e0: 02 80 00 0a be 2002608 <_RBTree_Sibling+0x3c> <== NEVER TAKEN 20025e4: 01 00 00 00 nop if(!(the_node->parent->parent)) return NULL; 20025e8: c6 00 80 00 ld [ %g2 ], %g3 20025ec: 80 a0 e0 00 cmp %g3, 0 20025f0: 02 80 00 06 be 2002608 <_RBTree_Sibling+0x3c> 20025f4: 01 00 00 00 nop if(the_node == the_node->parent->child[RBT_LEFT]) 20025f8: c2 00 a0 04 ld [ %g2 + 4 ], %g1 20025fc: 80 a2 00 01 cmp %o0, %g1 2002600: 22 80 00 02 be,a 2002608 <_RBTree_Sibling+0x3c> 2002604: c2 00 a0 08 ld [ %g2 + 8 ], %g1 return the_node->parent->child[RBT_RIGHT]; else return the_node->parent->child[RBT_LEFT]; } 2002608: 81 c3 e0 08 retl 200260c: 90 10 00 01 mov %g1, %o0 =============================================================================== 020091b0 <_RBTree_Validate_insert_unprotected>: * append operation. */ void _RBTree_Validate_insert_unprotected( RBTree_Node *the_node ) { 20091b0: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *u,*g; /* note: the insert root case is handled already */ /* if the parent is black, nothing needs to be done * otherwise may need to loop a few times */ while (_RBTree_Is_red(_RBTree_Parent(the_node))) { 20091b4: 10 80 00 1f b 2009230 <_RBTree_Validate_insert_unprotected+0x80> 20091b8: b6 10 20 01 mov 1, %i3 ) { 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; 20091bc: 80 a0 60 00 cmp %g1, 0 20091c0: 02 80 00 27 be 200925c <_RBTree_Validate_insert_unprotected+0xac><== NEVER TAKEN 20091c4: c2 07 60 04 ld [ %i5 + 4 ], %g1 { 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]) 20091c8: 80 a2 00 01 cmp %o0, %g1 20091cc: 22 80 00 02 be,a 20091d4 <_RBTree_Validate_insert_unprotected+0x24> 20091d0: c2 07 60 08 ld [ %i5 + 8 ], %g1 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 20091d4: 80 a0 60 00 cmp %g1, 0 20091d8: 22 80 00 21 be,a 200925c <_RBTree_Validate_insert_unprotected+0xac> 20091dc: c2 07 60 04 ld [ %i5 + 4 ], %g1 20091e0: c4 00 60 0c ld [ %g1 + 0xc ], %g2 20091e4: 80 a0 a0 01 cmp %g2, 1 20091e8: 32 80 00 1d bne,a 200925c <_RBTree_Validate_insert_unprotected+0xac> 20091ec: c2 07 60 04 ld [ %i5 + 4 ], %g1 u = _RBTree_Parent_sibling(the_node); 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; 20091f0: c0 22 20 0c clr [ %o0 + 0xc ] u->color = RBT_BLACK; 20091f4: c0 20 60 0c clr [ %g1 + 0xc ] g->color = RBT_RED; 20091f8: c4 27 60 0c st %g2, [ %i5 + 0xc ] 20091fc: 10 80 00 0d b 2009230 <_RBTree_Validate_insert_unprotected+0x80> 2009200: b0 10 00 1d mov %i5, %i0 RBTree_Direction dir = the_node != the_node->parent->child[0]; RBTree_Direction pdir = the_node->parent != g->child[0]; /* ensure node is on the same branch direction as parent */ if (dir != pdir) { _RBTree_Rotate(the_node->parent, pdir); 2009204: 7f ff ff cc call 2009134 <_RBTree_Rotate> 2009208: 92 10 00 1c mov %i4, %o1 the_node = the_node->child[pdir]; 200920c: 83 2f 20 02 sll %i4, 2, %g1 2009210: b0 06 00 01 add %i0, %g1, %i0 2009214: f0 06 20 04 ld [ %i0 + 4 ], %i0 } the_node->parent->color = RBT_BLACK; 2009218: c2 06 00 00 ld [ %i0 ], %g1 g->color = RBT_RED; /* now rotate grandparent in the other branch direction (toward uncle) */ _RBTree_Rotate(g, (1-pdir)); 200921c: 90 10 00 1d mov %i5, %o0 /* ensure node is on the same branch direction as parent */ if (dir != pdir) { _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; } the_node->parent->color = RBT_BLACK; 2009220: c0 20 60 0c clr [ %g1 + 0xc ] g->color = RBT_RED; 2009224: f6 27 60 0c st %i3, [ %i5 + 0xc ] /* now rotate grandparent in the other branch direction (toward uncle) */ _RBTree_Rotate(g, (1-pdir)); 2009228: 7f ff ff c3 call 2009134 <_RBTree_Rotate> 200922c: 92 26 c0 1c sub %i3, %i4, %o1 ISR_Level level; _ISR_Disable( level ); _RBTree_Insert_unprotected( tree, node ); _ISR_Enable( level ); } 2009230: d0 06 00 00 ld [ %i0 ], %o0 */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Parent( RBTree_Node *the_node ) { if (!the_node->parent->parent) return NULL; 2009234: fa 02 00 00 ld [ %o0 ], %i5 2009238: 80 a7 60 00 cmp %i5, 0 200923c: 22 80 00 14 be,a 200928c <_RBTree_Validate_insert_unprotected+0xdc> 2009240: c0 26 20 0c clr [ %i0 + 0xc ] */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2009244: c2 02 20 0c ld [ %o0 + 0xc ], %g1 2009248: 80 a0 60 01 cmp %g1, 1 200924c: 12 80 00 10 bne 200928c <_RBTree_Validate_insert_unprotected+0xdc> 2009250: 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; 2009254: 10 bf ff da b 20091bc <_RBTree_Validate_insert_unprotected+0xc> 2009258: c2 07 40 00 ld [ %i5 ], %g1 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]; RBTree_Direction pdir = the_node->parent != g->child[0]; 200925c: 82 1a 00 01 xor %o0, %g1, %g1 2009260: 80 a0 00 01 cmp %g0, %g1 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]; 2009264: c2 02 20 04 ld [ %o0 + 4 ], %g1 RBTree_Direction pdir = the_node->parent != g->child[0]; 2009268: b8 40 20 00 addx %g0, 0, %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]; 200926c: 82 1e 00 01 xor %i0, %g1, %g1 2009270: 80 a0 00 01 cmp %g0, %g1 2009274: 82 40 20 00 addx %g0, 0, %g1 RBTree_Direction pdir = the_node->parent != g->child[0]; /* ensure node is on the same branch direction as parent */ if (dir != pdir) { 2009278: 80 a0 40 1c cmp %g1, %i4 200927c: 12 bf ff e2 bne 2009204 <_RBTree_Validate_insert_unprotected+0x54> 2009280: 01 00 00 00 nop _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; } the_node->parent->color = RBT_BLACK; 2009284: 10 bf ff e6 b 200921c <_RBTree_Validate_insert_unprotected+0x6c> 2009288: c2 06 00 00 ld [ %i0 ], %g1 200928c: 81 c7 e0 08 ret 2009290: 81 e8 00 00 restore =============================================================================== 020076c8 <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 20076c8: 9d e3 bf 98 save %sp, -104, %sp 20076cc: 11 00 80 79 sethi %hi(0x201e400), %o0 20076d0: 92 10 00 18 mov %i0, %o1 20076d4: 90 12 23 f4 or %o0, 0x3f4, %o0 20076d8: 40 00 07 e3 call 2009664 <_Objects_Get> 20076dc: 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 ) { 20076e0: c2 07 bf fc ld [ %fp + -4 ], %g1 20076e4: 80 a0 60 00 cmp %g1, 0 20076e8: 12 80 00 25 bne 200777c <_Rate_monotonic_Timeout+0xb4> <== NEVER TAKEN 20076ec: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: the_thread = the_period->owner; 20076f0: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 20076f4: 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); 20076f8: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 20076fc: 80 88 80 01 btst %g2, %g1 2007700: 22 80 00 0b be,a 200772c <_Rate_monotonic_Timeout+0x64> 2007704: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 2007708: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 200770c: c2 07 60 08 ld [ %i5 + 8 ], %g1 2007710: 80 a0 80 01 cmp %g2, %g1 2007714: 32 80 00 06 bne,a 200772c <_Rate_monotonic_Timeout+0x64> 2007718: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 200771c: 13 04 00 ff sethi %hi(0x1003fc00), %o1 2007720: 40 00 0a af call 200a1dc <_Thread_Clear_state> 2007724: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 2007728: 30 80 00 06 b,a 2007740 <_Rate_monotonic_Timeout+0x78> _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 ) { 200772c: 80 a0 60 01 cmp %g1, 1 2007730: 12 80 00 0d bne 2007764 <_Rate_monotonic_Timeout+0x9c> 2007734: 82 10 20 04 mov 4, %g1 the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING; 2007738: 82 10 20 03 mov 3, %g1 200773c: c2 27 60 38 st %g1, [ %i5 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 2007740: 7f ff fe 70 call 2007100 <_Rate_monotonic_Initiate_statistics> 2007744: 90 10 00 1d mov %i5, %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007748: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200774c: 11 00 80 7a sethi %hi(0x201e800), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007750: c2 27 60 1c st %g1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007754: 90 12 22 1c or %o0, 0x21c, %o0 2007758: 40 00 0f 57 call 200b4b4 <_Watchdog_Insert> 200775c: 92 07 60 10 add %i5, 0x10, %o1 2007760: 30 80 00 02 b,a 2007768 <_Rate_monotonic_Timeout+0xa0> _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else the_period->state = RATE_MONOTONIC_EXPIRED; 2007764: 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--; 2007768: 03 00 80 7a sethi %hi(0x201e800), %g1 200776c: c4 00 61 60 ld [ %g1 + 0x160 ], %g2 ! 201e960 <_Thread_Dispatch_disable_level> 2007770: 84 00 bf ff add %g2, -1, %g2 2007774: c4 20 61 60 st %g2, [ %g1 + 0x160 ] return _Thread_Dispatch_disable_level; 2007778: c2 00 61 60 ld [ %g1 + 0x160 ], %g1 200777c: 81 c7 e0 08 ret 2007780: 81 e8 00 00 restore =============================================================================== 020085b0 <_Scheduler_priority_Tick>: #include #include void _Scheduler_priority_Tick( void ) { 20085b0: 9d e3 bf a0 save %sp, -96, %sp Thread_Control *executing; executing = _Thread_Executing; 20085b4: 03 00 80 73 sethi %hi(0x201cc00), %g1 20085b8: fa 00 63 f4 ld [ %g1 + 0x3f4 ], %i5 ! 201cff4 <_Per_CPU_Information+0xc> /* * If the thread is not preemptible or is not ready, then * just return. */ if ( !executing->is_preemptible ) 20085bc: c2 0f 60 74 ldub [ %i5 + 0x74 ], %g1 20085c0: 80 a0 60 00 cmp %g1, 0 20085c4: 02 80 00 25 be 2008658 <_Scheduler_priority_Tick+0xa8> 20085c8: 01 00 00 00 nop return; if ( !_States_Is_ready( executing->current_state ) ) 20085cc: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 20085d0: 80 a0 60 00 cmp %g1, 0 20085d4: 12 80 00 21 bne 2008658 <_Scheduler_priority_Tick+0xa8> 20085d8: 01 00 00 00 nop /* * The cpu budget algorithm determines what happens next. */ switch ( executing->budget_algorithm ) { 20085dc: c2 07 60 7c ld [ %i5 + 0x7c ], %g1 20085e0: 80 a0 60 01 cmp %g1, 1 20085e4: 0a 80 00 14 bcs 2008634 <_Scheduler_priority_Tick+0x84> 20085e8: 80 a0 60 02 cmp %g1, 2 20085ec: 28 80 00 07 bleu,a 2008608 <_Scheduler_priority_Tick+0x58> 20085f0: c2 07 60 78 ld [ %i5 + 0x78 ], %g1 20085f4: 80 a0 60 03 cmp %g1, 3 20085f8: 12 80 00 18 bne 2008658 <_Scheduler_priority_Tick+0xa8> <== NEVER TAKEN 20085fc: 01 00 00 00 nop } break; #if defined(RTEMS_SCORE_THREAD_ENABLE_SCHEDULER_CALLOUT) case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: if ( --executing->cpu_time_budget == 0 ) 2008600: 10 80 00 0f b 200863c <_Scheduler_priority_Tick+0x8c> 2008604: c2 07 60 78 ld [ %i5 + 0x78 ], %g1 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 ) { 2008608: 82 00 7f ff add %g1, -1, %g1 200860c: 80 a0 60 00 cmp %g1, 0 2008610: 14 80 00 09 bg 2008634 <_Scheduler_priority_Tick+0x84> 2008614: c2 27 60 78 st %g1, [ %i5 + 0x78 ] * always operates on the scheduler that 'owns' the currently executing * thread. */ RTEMS_INLINE_ROUTINE void _Scheduler_Yield( void ) { _Scheduler.Operations.yield(); 2008618: 03 00 80 6f sethi %hi(0x201bc00), %g1 200861c: c2 00 62 40 ld [ %g1 + 0x240 ], %g1 ! 201be40 <_Scheduler+0xc> 2008620: 9f c0 40 00 call %g1 2008624: 01 00 00 00 nop * 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; 2008628: 03 00 80 72 sethi %hi(0x201c800), %g1 200862c: c2 00 62 14 ld [ %g1 + 0x214 ], %g1 ! 201ca14 <_Thread_Ticks_per_timeslice> 2008630: c2 27 60 78 st %g1, [ %i5 + 0x78 ] 2008634: 81 c7 e0 08 ret 2008638: 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 ) 200863c: 82 00 7f ff add %g1, -1, %g1 2008640: 80 a0 60 00 cmp %g1, 0 2008644: 12 bf ff fc bne 2008634 <_Scheduler_priority_Tick+0x84> 2008648: c2 27 60 78 st %g1, [ %i5 + 0x78 ] (*executing->budget_callout)( executing ); 200864c: c2 07 60 80 ld [ %i5 + 0x80 ], %g1 2008650: 9f c0 40 00 call %g1 2008654: 90 10 00 1d mov %i5, %o0 2008658: 81 c7 e0 08 ret 200865c: 81 e8 00 00 restore =============================================================================== 02007154 <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 2007154: 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(); 2007158: 03 00 80 79 sethi %hi(0x201e400), %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; 200715c: 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) || 2007160: 80 a6 20 00 cmp %i0, 0 2007164: 02 80 00 2b be 2007210 <_TOD_Validate+0xbc> <== NEVER TAKEN 2007168: d2 00 60 c8 ld [ %g1 + 0xc8 ], %o1 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 200716c: 11 00 03 d0 sethi %hi(0xf4000), %o0 2007170: 40 00 4a 05 call 2019984 <.udiv> 2007174: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 2007178: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200717c: 80 a0 40 08 cmp %g1, %o0 2007180: 3a 80 00 25 bcc,a 2007214 <_TOD_Validate+0xc0> 2007184: b0 0f 60 01 and %i5, 1, %i0 (the_tod->ticks >= ticks_per_second) || 2007188: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200718c: 80 a0 60 3b cmp %g1, 0x3b 2007190: 38 80 00 21 bgu,a 2007214 <_TOD_Validate+0xc0> 2007194: b0 0f 60 01 and %i5, 1, %i0 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 2007198: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 200719c: 80 a0 60 3b cmp %g1, 0x3b 20071a0: 38 80 00 1d bgu,a 2007214 <_TOD_Validate+0xc0> 20071a4: b0 0f 60 01 and %i5, 1, %i0 (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 20071a8: c2 06 20 0c ld [ %i0 + 0xc ], %g1 20071ac: 80 a0 60 17 cmp %g1, 0x17 20071b0: 38 80 00 19 bgu,a 2007214 <_TOD_Validate+0xc0> 20071b4: b0 0f 60 01 and %i5, 1, %i0 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 20071b8: 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) || 20071bc: 80 a0 60 00 cmp %g1, 0 20071c0: 02 80 00 14 be 2007210 <_TOD_Validate+0xbc> <== NEVER TAKEN 20071c4: 80 a0 60 0c cmp %g1, 0xc (the_tod->month == 0) || 20071c8: 38 80 00 13 bgu,a 2007214 <_TOD_Validate+0xc0> 20071cc: b0 0f 60 01 and %i5, 1, %i0 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 20071d0: c6 06 00 00 ld [ %i0 ], %g3 (the_tod->ticks >= ticks_per_second) || (the_tod->second >= TOD_SECONDS_PER_MINUTE) || (the_tod->minute >= TOD_MINUTES_PER_HOUR) || (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || (the_tod->month > TOD_MONTHS_PER_YEAR) || 20071d4: 80 a0 e7 c3 cmp %g3, 0x7c3 20071d8: 28 80 00 0f bleu,a 2007214 <_TOD_Validate+0xc0> 20071dc: b0 0f 60 01 and %i5, 1, %i0 (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 20071e0: c4 06 20 08 ld [ %i0 + 8 ], %g2 (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) || 20071e4: 80 a0 a0 00 cmp %g2, 0 20071e8: 02 80 00 0a be 2007210 <_TOD_Validate+0xbc> <== NEVER TAKEN 20071ec: 80 88 e0 03 btst 3, %g3 20071f0: 07 00 80 74 sethi %hi(0x201d000), %g3 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 20071f4: 12 80 00 03 bne 2007200 <_TOD_Validate+0xac> 20071f8: 86 10 e0 18 or %g3, 0x18, %g3 ! 201d018 <_TOD_Days_per_month> days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 20071fc: 82 00 60 0d add %g1, 0xd, %g1 else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; 2007200: 83 28 60 02 sll %g1, 2, %g1 2007204: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 * false - if the the_tod is invalid * * NOTE: This routine only works for leap-years through 2099. */ bool _TOD_Validate( 2007208: 80 a0 40 02 cmp %g1, %g2 200720c: ba 60 3f ff subx %g0, -1, %i5 if ( the_tod->day > days_in_month ) return false; return true; } 2007210: b0 0f 60 01 and %i5, 1, %i0 2007214: 81 c7 e0 08 ret 2007218: 81 e8 00 00 restore =============================================================================== 02008870 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 2008870: 9d e3 bf a0 save %sp, -96, %sp States_Control state, original_state; /* * Save original state */ original_state = the_thread->current_state; 2008874: 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 ); 2008878: 40 00 03 62 call 2009600 <_Thread_Set_transient> 200887c: 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 ) 2008880: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2008884: 80 a0 40 19 cmp %g1, %i1 2008888: 02 80 00 05 be 200889c <_Thread_Change_priority+0x2c> 200888c: ba 10 00 18 mov %i0, %i5 _Thread_Set_priority( the_thread, new_priority ); 2008890: 90 10 00 18 mov %i0, %o0 2008894: 40 00 03 42 call 200959c <_Thread_Set_priority> 2008898: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 200889c: 7f ff e6 38 call 200217c 20088a0: 01 00 00 00 nop 20088a4: b6 10 00 08 mov %o0, %i3 /* * 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; 20088a8: f2 07 60 10 ld [ %i5 + 0x10 ], %i1 if ( state != STATES_TRANSIENT ) { 20088ac: 80 a6 60 04 cmp %i1, 4 20088b0: 02 80 00 10 be 20088f0 <_Thread_Change_priority+0x80> 20088b4: b8 0f 20 04 and %i4, 4, %i4 /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) 20088b8: 80 a7 20 00 cmp %i4, 0 20088bc: 12 80 00 03 bne 20088c8 <_Thread_Change_priority+0x58> <== NEVER TAKEN 20088c0: 82 0e 7f fb and %i1, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); 20088c4: c2 27 60 10 st %g1, [ %i5 + 0x10 ] _ISR_Enable( level ); 20088c8: 7f ff e6 31 call 200218c 20088cc: 90 10 00 1b mov %i3, %o0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 20088d0: 03 00 00 ef sethi %hi(0x3bc00), %g1 20088d4: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 20088d8: 80 8e 40 01 btst %i1, %g1 20088dc: 02 80 00 29 be 2008980 <_Thread_Change_priority+0x110> 20088e0: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 20088e4: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 20088e8: 40 00 02 ff call 20094e4 <_Thread_queue_Requeue> 20088ec: 93 e8 00 1d restore %g0, %i5, %o1 } return; } /* Only clear the transient state if it wasn't set already */ if ( ! _States_Is_transient( original_state ) ) { 20088f0: 80 a7 20 00 cmp %i4, 0 20088f4: 12 80 00 0b bne 2008920 <_Thread_Change_priority+0xb0> <== NEVER TAKEN 20088f8: 03 00 80 6f sethi %hi(0x201bc00), %g1 * Interrupts are STILL disabled. * We now know the thread will be in the READY state when we remove * 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 ); 20088fc: c0 27 60 10 clr [ %i5 + 0x10 ] if ( prepend_it ) 2008900: 80 a6 a0 00 cmp %i2, 0 2008904: 02 80 00 04 be 2008914 <_Thread_Change_priority+0xa4> 2008908: 82 10 62 34 or %g1, 0x234, %g1 */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue_first( the_thread ); 200890c: 10 80 00 03 b 2008918 <_Thread_Change_priority+0xa8> 2008910: c2 00 60 28 ld [ %g1 + 0x28 ], %g1 */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue( the_thread ); 2008914: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 2008918: 9f c0 40 00 call %g1 200891c: 90 10 00 1d mov %i5, %o0 _Scheduler_Enqueue_first( the_thread ); else _Scheduler_Enqueue( the_thread ); } _ISR_Flash( level ); 2008920: 7f ff e6 1b call 200218c 2008924: 90 10 00 1b mov %i3, %o0 2008928: 7f ff e6 15 call 200217c 200892c: 01 00 00 00 nop 2008930: 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(); 2008934: 03 00 80 6f sethi %hi(0x201bc00), %g1 2008938: c2 00 62 3c ld [ %g1 + 0x23c ], %g1 ! 201be3c <_Scheduler+0x8> 200893c: 9f c0 40 00 call %g1 2008940: 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 ); 2008944: 03 00 80 73 sethi %hi(0x201cc00), %g1 2008948: 82 10 63 e8 or %g1, 0x3e8, %g1 ! 201cfe8 <_Per_CPU_Information> 200894c: 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() && 2008950: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 2008954: 80 a0 80 03 cmp %g2, %g3 2008958: 02 80 00 08 be 2008978 <_Thread_Change_priority+0x108> 200895c: 01 00 00 00 nop 2008960: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 2008964: 80 a0 a0 00 cmp %g2, 0 2008968: 02 80 00 04 be 2008978 <_Thread_Change_priority+0x108> 200896c: 01 00 00 00 nop _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 2008970: 84 10 20 01 mov 1, %g2 ! 1 2008974: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] _ISR_Enable( level ); 2008978: 7f ff e6 05 call 200218c 200897c: 81 e8 00 00 restore 2008980: 81 c7 e0 08 ret 2008984: 81 e8 00 00 restore =============================================================================== 02008b74 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 2008b74: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2008b78: 90 10 00 18 mov %i0, %o0 2008b7c: 40 00 00 6e call 2008d34 <_Thread_Get> 2008b80: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2008b84: c2 07 bf fc ld [ %fp + -4 ], %g1 2008b88: 80 a0 60 00 cmp %g1, 0 2008b8c: 12 80 00 09 bne 2008bb0 <_Thread_Delay_ended+0x3c> <== NEVER TAKEN 2008b90: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 2008b94: 7f ff ff 7d call 2008988 <_Thread_Clear_state> 2008b98: 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--; 2008b9c: 03 00 80 72 sethi %hi(0x201c800), %g1 2008ba0: c4 00 62 b0 ld [ %g1 + 0x2b0 ], %g2 ! 201cab0 <_Thread_Dispatch_disable_level> 2008ba4: 84 00 bf ff add %g2, -1, %g2 2008ba8: c4 20 62 b0 st %g2, [ %g1 + 0x2b0 ] return _Thread_Dispatch_disable_level; 2008bac: c2 00 62 b0 ld [ %g1 + 0x2b0 ], %g1 2008bb0: 81 c7 e0 08 ret 2008bb4: 81 e8 00 00 restore =============================================================================== 02008bb8 <_Thread_Dispatch>: * INTERRUPT LATENCY: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 2008bb8: 9d e3 bf 90 save %sp, -112, %sp * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2008bbc: 03 00 80 72 sethi %hi(0x201c800), %g1 2008bc0: c4 00 62 b0 ld [ %g1 + 0x2b0 ], %g2 ! 201cab0 <_Thread_Dispatch_disable_level> 2008bc4: 84 00 a0 01 inc %g2 2008bc8: c4 20 62 b0 st %g2, [ %g1 + 0x2b0 ] return _Thread_Dispatch_disable_level; 2008bcc: c2 00 62 b0 ld [ %g1 + 0x2b0 ], %g1 #endif /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; 2008bd0: 33 00 80 73 sethi %hi(0x201cc00), %i1 2008bd4: b4 16 63 e8 or %i1, 0x3e8, %i2 ! 201cfe8 <_Per_CPU_Information> _ISR_Disable( level ); 2008bd8: 7f ff e5 69 call 200217c 2008bdc: fa 06 a0 0c ld [ %i2 + 0xc ], %i5 #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; 2008be0: 21 00 80 72 sethi %hi(0x201c800), %l0 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 2008be4: b4 06 a0 1c add %i2, 0x1c, %i2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 2008be8: 31 00 80 72 sethi %hi(0x201c800), %i0 /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 2008bec: 10 80 00 38 b 2008ccc <_Thread_Dispatch+0x114> 2008bf0: 37 00 80 72 sethi %hi(0x201c800), %i3 heir = _Thread_Heir; _Thread_Dispatch_necessary = false; 2008bf4: c0 28 60 18 clrb [ %g1 + 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 ) 2008bf8: 80 a7 00 1d cmp %i4, %i5 2008bfc: 02 80 00 39 be 2008ce0 <_Thread_Dispatch+0x128> 2008c00: f8 20 60 0c st %i4, [ %g1 + 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 ) 2008c04: c2 07 20 7c ld [ %i4 + 0x7c ], %g1 2008c08: 80 a0 60 01 cmp %g1, 1 2008c0c: 12 80 00 03 bne 2008c18 <_Thread_Dispatch+0x60> 2008c10: c2 04 22 14 ld [ %l0 + 0x214 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 2008c14: c2 27 20 78 st %g1, [ %i4 + 0x78 ] _ISR_Enable( level ); 2008c18: 7f ff e5 5d call 200218c 2008c1c: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 2008c20: 40 00 0e cd call 200c754 <_TOD_Get_uptime> 2008c24: 90 07 bf f0 add %fp, -16, %o0 _Timestamp_Subtract( 2008c28: 90 10 00 1a mov %i2, %o0 2008c2c: 92 07 bf f0 add %fp, -16, %o1 2008c30: 40 00 02 ed call 20097e4 <_Timespec_Subtract> 2008c34: 94 07 bf f8 add %fp, -8, %o2 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); 2008c38: 90 07 60 84 add %i5, 0x84, %o0 2008c3c: 40 00 02 d1 call 2009780 <_Timespec_Add_to> 2008c40: 92 07 bf f8 add %fp, -8, %o1 _Thread_Time_of_last_context_switch = uptime; 2008c44: c4 07 bf f0 ld [ %fp + -16 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 2008c48: c2 06 23 38 ld [ %i0 + 0x338 ], %g1 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); _Thread_Time_of_last_context_switch = uptime; 2008c4c: c4 26 80 00 st %g2, [ %i2 ] 2008c50: c4 07 bf f4 ld [ %fp + -12 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 2008c54: 80 a0 60 00 cmp %g1, 0 2008c58: 02 80 00 06 be 2008c70 <_Thread_Dispatch+0xb8> <== NEVER TAKEN 2008c5c: c4 26 a0 04 st %g2, [ %i2 + 4 ] executing->libc_reent = *_Thread_libc_reent; 2008c60: c4 00 40 00 ld [ %g1 ], %g2 2008c64: c4 27 61 54 st %g2, [ %i5 + 0x154 ] *_Thread_libc_reent = heir->libc_reent; 2008c68: c4 07 21 54 ld [ %i4 + 0x154 ], %g2 2008c6c: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 2008c70: 90 10 00 1d mov %i5, %o0 2008c74: 40 00 03 8a call 2009a9c <_User_extensions_Thread_switch> 2008c78: 92 10 00 1c mov %i4, %o1 if ( executing->fp_context != NULL ) _Context_Save_fp( &executing->fp_context ); #endif #endif _Context_Switch( &executing->Registers, &heir->Registers ); 2008c7c: 90 07 60 c8 add %i5, 0xc8, %o0 2008c80: 40 00 04 b0 call 2009f40 <_CPU_Context_switch> 2008c84: 92 07 20 c8 add %i4, 0xc8, %o1 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 2008c88: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 2008c8c: 80 a0 60 00 cmp %g1, 0 2008c90: 02 80 00 0c be 2008cc0 <_Thread_Dispatch+0x108> 2008c94: d0 06 e3 34 ld [ %i3 + 0x334 ], %o0 2008c98: 80 a7 40 08 cmp %i5, %o0 2008c9c: 02 80 00 09 be 2008cc0 <_Thread_Dispatch+0x108> 2008ca0: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 2008ca4: 02 80 00 04 be 2008cb4 <_Thread_Dispatch+0xfc> 2008ca8: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 2008cac: 40 00 04 6b call 2009e58 <_CPU_Context_save_fp> 2008cb0: 90 02 21 50 add %o0, 0x150, %o0 _Context_Restore_fp( &executing->fp_context ); 2008cb4: 40 00 04 86 call 2009ecc <_CPU_Context_restore_fp> 2008cb8: 90 07 61 50 add %i5, 0x150, %o0 _Thread_Allocated_fp = executing; 2008cbc: fa 26 e3 34 st %i5, [ %i3 + 0x334 ] if ( executing->fp_context != NULL ) _Context_Restore_fp( &executing->fp_context ); #endif #endif executing = _Thread_Executing; 2008cc0: 82 16 63 e8 or %i1, 0x3e8, %g1 _ISR_Disable( level ); 2008cc4: 7f ff e5 2e call 200217c 2008cc8: fa 00 60 0c ld [ %g1 + 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 ) { 2008ccc: 82 16 63 e8 or %i1, 0x3e8, %g1 2008cd0: c4 08 60 18 ldub [ %g1 + 0x18 ], %g2 2008cd4: 80 a0 a0 00 cmp %g2, 0 2008cd8: 32 bf ff c7 bne,a 2008bf4 <_Thread_Dispatch+0x3c> 2008cdc: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 * This routine sets thread dispatch level to the * value passed in. */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_set_disable_level(uint32_t value) { _Thread_Dispatch_disable_level = value; 2008ce0: 03 00 80 72 sethi %hi(0x201c800), %g1 2008ce4: c0 20 62 b0 clr [ %g1 + 0x2b0 ] ! 201cab0 <_Thread_Dispatch_disable_level> } post_switch: _Thread_Dispatch_set_disable_level( 0 ); _ISR_Enable( level ); 2008ce8: 7f ff e5 29 call 200218c 2008cec: 01 00 00 00 nop _API_extensions_Run_postswitch(); 2008cf0: 7f ff f8 3e call 2006de8 <_API_extensions_Run_postswitch> 2008cf4: 01 00 00 00 nop } 2008cf8: 81 c7 e0 08 ret 2008cfc: 81 e8 00 00 restore =============================================================================== 0200e8a8 <_Thread_Handler>: * * Output parameters: NONE */ void _Thread_Handler( void ) { 200e8a8: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static char doneConstructors; char doneCons; #endif executing = _Thread_Executing; 200e8ac: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e8b0: fa 00 63 f4 ld [ %g1 + 0x3f4 ], %i5 ! 201cff4 <_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(); 200e8b4: 3f 00 80 3a sethi %hi(0x200e800), %i7 200e8b8: be 17 e0 a8 or %i7, 0xa8, %i7 ! 200e8a8 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 200e8bc: d0 07 60 ac ld [ %i5 + 0xac ], %o0 _ISR_Set_level(level); 200e8c0: 7f ff ce 33 call 200218c 200e8c4: 91 2a 20 08 sll %o0, 8, %o0 #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200e8c8: 03 00 80 71 sethi %hi(0x201c400), %g1 doneConstructors = 1; 200e8cc: 84 10 20 01 mov 1, %g2 level = executing->Start.isr_level; _ISR_Set_level(level); #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200e8d0: f8 08 63 6c ldub [ %g1 + 0x36c ], %i4 doneConstructors = 1; 200e8d4: c4 28 63 6c stb %g2, [ %g1 + 0x36c ] #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200e8d8: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 200e8dc: 80 a0 60 00 cmp %g1, 0 200e8e0: 02 80 00 0c be 200e910 <_Thread_Handler+0x68> 200e8e4: 03 00 80 72 sethi %hi(0x201c800), %g1 #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 ); 200e8e8: d0 00 63 34 ld [ %g1 + 0x334 ], %o0 ! 201cb34 <_Thread_Allocated_fp> 200e8ec: 80 a7 40 08 cmp %i5, %o0 200e8f0: 02 80 00 08 be 200e910 <_Thread_Handler+0x68> 200e8f4: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200e8f8: 22 80 00 06 be,a 200e910 <_Thread_Handler+0x68> 200e8fc: fa 20 63 34 st %i5, [ %g1 + 0x334 ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200e900: 7f ff ed 56 call 2009e58 <_CPU_Context_save_fp> 200e904: 90 02 21 50 add %o0, 0x150, %o0 _Thread_Allocated_fp = executing; 200e908: 03 00 80 72 sethi %hi(0x201c800), %g1 200e90c: fa 20 63 34 st %i5, [ %g1 + 0x334 ] ! 201cb34 <_Thread_Allocated_fp> /* * 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 ); 200e910: 7f ff eb f4 call 20098e0 <_User_extensions_Thread_begin> 200e914: 90 10 00 1d mov %i5, %o0 /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 200e918: 7f ff e8 fa call 2008d00 <_Thread_Enable_dispatch> 200e91c: b9 2f 20 18 sll %i4, 0x18, %i4 /* * _init could be a weak symbol and we SHOULD test it but it isn't * in any configuration I know of and it generates a warning on every * RTEMS target configuration. --joel (12 May 2007) */ if (!doneCons) /* && (volatile void *)_init) */ { 200e920: 80 a7 20 00 cmp %i4, 0 200e924: 32 80 00 05 bne,a 200e938 <_Thread_Handler+0x90> 200e928: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 INIT_NAME (); 200e92c: 40 00 34 f9 call 201bd10 <_init> 200e930: 01 00 00 00 nop #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200e934: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 200e938: 80 a0 60 00 cmp %g1, 0 200e93c: 12 80 00 05 bne 200e950 <_Thread_Handler+0xa8> 200e940: 80 a0 60 01 cmp %g1, 1 executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 200e944: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 200e948: 10 80 00 06 b 200e960 <_Thread_Handler+0xb8> 200e94c: d0 07 60 9c ld [ %i5 + 0x9c ], %o0 executing->Start.numeric_argument ); } #if defined(RTEMS_POSIX_API) else if ( executing->Start.prototype == THREAD_START_POINTER ) { 200e950: 12 80 00 07 bne 200e96c <_Thread_Handler+0xc4> <== NEVER TAKEN 200e954: 01 00 00 00 nop executing->Wait.return_argument = (*(Thread_Entry_pointer) executing->Start.entry_point)( 200e958: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 200e95c: d0 07 60 98 ld [ %i5 + 0x98 ], %o0 200e960: 9f c0 40 00 call %g1 200e964: 01 00 00 00 nop executing->Start.numeric_argument ); } #if defined(RTEMS_POSIX_API) else if ( executing->Start.prototype == THREAD_START_POINTER ) { executing->Wait.return_argument = 200e968: d0 27 60 28 st %o0, [ %i5 + 0x28 ] * 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 ); 200e96c: 7f ff eb ee call 2009924 <_User_extensions_Thread_exitted> 200e970: 90 10 00 1d mov %i5, %o0 _Internal_error_Occurred( 200e974: 90 10 20 00 clr %o0 200e978: 92 10 20 01 mov 1, %o1 200e97c: 7f ff e3 be call 2007874 <_Internal_error_Occurred> 200e980: 94 10 20 05 mov 5, %o2 =============================================================================== 02008de4 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 2008de4: 9d e3 bf a0 save %sp, -96, %sp 2008de8: 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; 2008dec: c0 26 61 58 clr [ %i1 + 0x158 ] 2008df0: c0 26 61 5c clr [ %i1 + 0x15c ] extensions_area = NULL; the_thread->libc_reent = NULL; 2008df4: 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 ) { 2008df8: e0 07 a0 60 ld [ %fp + 0x60 ], %l0 2008dfc: e2 00 40 00 ld [ %g1 ], %l1 if ( !actual_stack_size || actual_stack_size < stack_size ) return false; /* stack allocation failed */ stack = the_thread->Start.stack; #else if ( !stack_area ) { 2008e00: 80 a6 a0 00 cmp %i2, 0 2008e04: 12 80 00 0d bne 2008e38 <_Thread_Initialize+0x54> 2008e08: e4 0f a0 5f ldub [ %fp + 0x5f ], %l2 actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); 2008e0c: 90 10 00 19 mov %i1, %o0 2008e10: 40 00 02 0b call 200963c <_Thread_Stack_Allocate> 2008e14: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 2008e18: 80 a2 00 1b cmp %o0, %i3 2008e1c: 0a 80 00 6a bcs 2008fc4 <_Thread_Initialize+0x1e0> 2008e20: 80 a2 20 00 cmp %o0, 0 2008e24: 02 80 00 68 be 2008fc4 <_Thread_Initialize+0x1e0> <== NEVER TAKEN 2008e28: 82 10 20 01 mov 1, %g1 return false; /* stack allocation failed */ stack = the_thread->Start.stack; 2008e2c: f4 06 60 c4 ld [ %i1 + 0xc4 ], %i2 the_thread->Start.core_allocated_stack = true; 2008e30: 10 80 00 04 b 2008e40 <_Thread_Initialize+0x5c> 2008e34: c2 2e 60 b4 stb %g1, [ %i1 + 0xb4 ] } else { stack = stack_area; actual_stack_size = stack_size; the_thread->Start.core_allocated_stack = false; 2008e38: c0 2e 60 b4 clrb [ %i1 + 0xb4 ] 2008e3c: 90 10 00 1b mov %i3, %o0 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 2008e40: f4 26 60 bc st %i2, [ %i1 + 0xbc ] the_stack->size = size; 2008e44: d0 26 60 b8 st %o0, [ %i1 + 0xb8 ] /* * Allocate the floating point area for this thread */ #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) if ( is_fp ) { 2008e48: 80 a7 20 00 cmp %i4, 0 2008e4c: 02 80 00 07 be 2008e68 <_Thread_Initialize+0x84> 2008e50: b6 10 20 00 clr %i3 fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE ); 2008e54: 40 00 03 e5 call 2009de8 <_Workspace_Allocate> 2008e58: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 2008e5c: b6 92 20 00 orcc %o0, 0, %i3 2008e60: 02 80 00 4a be 2008f88 <_Thread_Initialize+0x1a4> 2008e64: b8 10 20 00 clr %i4 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2008e68: 03 00 80 72 sethi %hi(0x201c800), %g1 2008e6c: d0 00 63 44 ld [ %g1 + 0x344 ], %o0 ! 201cb44 <_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; 2008e70: f6 26 61 50 st %i3, [ %i1 + 0x150 ] the_thread->Start.fp_context = fp_area; 2008e74: f6 26 60 c0 st %i3, [ %i1 + 0xc0 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2008e78: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 2008e7c: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 2008e80: c0 26 60 68 clr [ %i1 + 0x68 ] the_watchdog->user_data = user_data; 2008e84: c0 26 60 6c clr [ %i1 + 0x6c ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2008e88: 80 a2 20 00 cmp %o0, 0 2008e8c: 02 80 00 08 be 2008eac <_Thread_Initialize+0xc8> 2008e90: b8 10 20 00 clr %i4 extensions_area = _Workspace_Allocate( 2008e94: 90 02 20 01 inc %o0 2008e98: 40 00 03 d4 call 2009de8 <_Workspace_Allocate> 2008e9c: 91 2a 20 02 sll %o0, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 2008ea0: b8 92 20 00 orcc %o0, 0, %i4 2008ea4: 02 80 00 3a be 2008f8c <_Thread_Initialize+0x1a8> 2008ea8: b4 10 20 00 clr %i2 * if they are linked to the thread. An extension user may * create the extension long after tasks have been created * so they cannot rely on the thread create user extension * call. */ if ( the_thread->extensions ) { 2008eac: 80 a7 20 00 cmp %i4, 0 2008eb0: 02 80 00 0c be 2008ee0 <_Thread_Initialize+0xfc> 2008eb4: f8 26 61 60 st %i4, [ %i1 + 0x160 ] for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) 2008eb8: 03 00 80 72 sethi %hi(0x201c800), %g1 2008ebc: c4 00 63 44 ld [ %g1 + 0x344 ], %g2 ! 201cb44 <_Thread_Maximum_extensions> 2008ec0: 10 80 00 05 b 2008ed4 <_Thread_Initialize+0xf0> 2008ec4: 82 10 20 00 clr %g1 the_thread->extensions[i] = NULL; 2008ec8: 87 28 60 02 sll %g1, 2, %g3 * 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++ ) 2008ecc: 82 00 60 01 inc %g1 the_thread->extensions[i] = NULL; 2008ed0: c0 21 00 03 clr [ %g4 + %g3 ] * 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++ ) 2008ed4: 80 a0 40 02 cmp %g1, %g2 2008ed8: 28 bf ff fc bleu,a 2008ec8 <_Thread_Initialize+0xe4> 2008edc: c8 06 61 60 ld [ %i1 + 0x160 ], %g4 * General initialization */ the_thread->Start.is_preemptible = is_preemptible; the_thread->Start.budget_algorithm = budget_algorithm; the_thread->Start.budget_callout = budget_callout; 2008ee0: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 2008ee4: e4 2e 60 a0 stb %l2, [ %i1 + 0xa0 ] the_thread->Start.budget_algorithm = budget_algorithm; 2008ee8: e0 26 60 a4 st %l0, [ %i1 + 0xa4 ] the_thread->Start.budget_callout = budget_callout; switch ( budget_algorithm ) { 2008eec: 80 a4 20 02 cmp %l0, 2 2008ef0: 12 80 00 05 bne 2008f04 <_Thread_Initialize+0x120> 2008ef4: c2 26 60 a8 st %g1, [ %i1 + 0xa8 ] case THREAD_CPU_BUDGET_ALGORITHM_NONE: case THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE: break; #if defined(RTEMS_SCORE_THREAD_ENABLE_EXHAUST_TIMESLICE) case THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; 2008ef8: 03 00 80 72 sethi %hi(0x201c800), %g1 2008efc: c2 00 62 14 ld [ %g1 + 0x214 ], %g1 ! 201ca14 <_Thread_Ticks_per_timeslice> 2008f00: c2 26 60 78 st %g1, [ %i1 + 0x78 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2008f04: c2 07 a0 68 ld [ %fp + 0x68 ], %g1 the_thread->current_state = STATES_DORMANT; the_thread->Wait.queue = NULL; 2008f08: c0 26 60 44 clr [ %i1 + 0x44 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2008f0c: c2 26 60 ac st %g1, [ %i1 + 0xac ] the_thread->current_state = STATES_DORMANT; 2008f10: 82 10 20 01 mov 1, %g1 2008f14: c2 26 60 10 st %g1, [ %i1 + 0x10 ] */ RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate( Thread_Control *the_thread ) { return _Scheduler.Operations.allocate( the_thread ); 2008f18: 03 00 80 6f sethi %hi(0x201bc00), %g1 2008f1c: c2 00 62 4c ld [ %g1 + 0x24c ], %g1 ! 201be4c <_Scheduler+0x18> the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 2008f20: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 2008f24: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 2008f28: fa 26 60 b0 st %i5, [ %i1 + 0xb0 ] 2008f2c: 9f c0 40 00 call %g1 2008f30: 90 10 00 19 mov %i1, %o0 sched =_Scheduler_Allocate( the_thread ); if ( !sched ) 2008f34: b4 92 20 00 orcc %o0, 0, %i2 2008f38: 02 80 00 15 be 2008f8c <_Thread_Initialize+0x1a8> 2008f3c: 90 10 00 19 mov %i1, %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 2008f40: 40 00 01 97 call 200959c <_Thread_Set_priority> 2008f44: 92 10 00 1d mov %i5, %o1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008f48: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2008f4c: c2 16 60 0a lduh [ %i1 + 0xa ], %g1 /* * Initialize the CPU usage statistics */ #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ _Timestamp_Set_to_zero( &the_thread->cpu_time_used ); 2008f50: c0 26 60 84 clr [ %i1 + 0x84 ] 2008f54: c0 26 60 88 clr [ %i1 + 0x88 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008f58: 83 28 60 02 sll %g1, 2, %g1 2008f5c: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2008f60: e2 26 60 0c st %l1, [ %i1 + 0xc ] * enabled when we get here. We want to be able to run the * user extensions with dispatching enabled. The Allocator * Mutex provides sufficient protection to let the user extensions * run safely. */ extension_status = _User_extensions_Thread_create( the_thread ); 2008f64: 90 10 00 19 mov %i1, %o0 2008f68: 40 00 02 90 call 20099a8 <_User_extensions_Thread_create> 2008f6c: b0 10 20 01 mov 1, %i0 if ( extension_status ) 2008f70: 80 8a 20 ff btst 0xff, %o0 2008f74: 02 80 00 06 be 2008f8c <_Thread_Initialize+0x1a8> 2008f78: 01 00 00 00 nop 2008f7c: b0 0e 20 01 and %i0, 1, %i0 2008f80: 81 c7 e0 08 ret 2008f84: 81 e8 00 00 restore 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; 2008f88: b4 10 20 00 clr %i2 extension_status = _User_extensions_Thread_create( the_thread ); if ( extension_status ) return true; failed: _Workspace_Free( the_thread->libc_reent ); 2008f8c: 40 00 03 9f call 2009e08 <_Workspace_Free> 2008f90: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 2008f94: 40 00 03 9d call 2009e08 <_Workspace_Free> 2008f98: d0 06 61 58 ld [ %i1 + 0x158 ], %o0 2008f9c: 40 00 03 9b call 2009e08 <_Workspace_Free> 2008fa0: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 _Workspace_Free( extensions_area ); 2008fa4: 40 00 03 99 call 2009e08 <_Workspace_Free> 2008fa8: 90 10 00 1c mov %i4, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); 2008fac: 40 00 03 97 call 2009e08 <_Workspace_Free> 2008fb0: 90 10 00 1b mov %i3, %o0 #endif _Workspace_Free( sched ); 2008fb4: 40 00 03 95 call 2009e08 <_Workspace_Free> 2008fb8: 90 10 00 1a mov %i2, %o0 _Thread_Stack_Free( the_thread ); 2008fbc: 40 00 01 b7 call 2009698 <_Thread_Stack_Free> 2008fc0: 90 10 00 19 mov %i1, %o0 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 */ 2008fc4: b0 10 20 00 clr %i0 _Workspace_Free( sched ); _Thread_Stack_Free( the_thread ); return false; } 2008fc8: b0 0e 20 01 and %i0, 1, %i0 2008fcc: 81 c7 e0 08 ret 2008fd0: 81 e8 00 00 restore =============================================================================== 02009698 <_Thread_Stack_Free>: */ void _Thread_Stack_Free( Thread_Control *the_thread ) { 2009698: 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 ) 200969c: c2 0e 20 b4 ldub [ %i0 + 0xb4 ], %g1 20096a0: 80 a0 60 00 cmp %g1, 0 20096a4: 02 80 00 0d be 20096d8 <_Thread_Stack_Free+0x40> <== NEVER TAKEN 20096a8: 01 00 00 00 nop * Call ONLY the CPU table stack free hook, or the * the RTEMS workspace free. This is so the free * routine properly matches the allocation of the stack. */ if ( Configuration.stack_free_hook ) 20096ac: 03 00 80 6f sethi %hi(0x201bc00), %g1 20096b0: c2 00 61 70 ld [ %g1 + 0x170 ], %g1 ! 201bd70 20096b4: 80 a0 60 00 cmp %g1, 0 20096b8: 02 80 00 06 be 20096d0 <_Thread_Stack_Free+0x38> 20096bc: d0 06 20 bc ld [ %i0 + 0xbc ], %o0 (*Configuration.stack_free_hook)( the_thread->Start.Initial_stack.area ); 20096c0: 9f c0 40 00 call %g1 20096c4: 01 00 00 00 nop 20096c8: 81 c7 e0 08 ret 20096cc: 81 e8 00 00 restore else _Workspace_Free( the_thread->Start.Initial_stack.area ); 20096d0: 40 00 01 ce call 2009e08 <_Workspace_Free> 20096d4: 91 e8 00 08 restore %g0, %o0, %o0 20096d8: 81 c7 e0 08 ret <== NOT EXECUTED 20096dc: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 020094e4 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 20094e4: 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 ) 20094e8: 80 a6 20 00 cmp %i0, 0 20094ec: 02 80 00 19 be 2009550 <_Thread_queue_Requeue+0x6c> <== NEVER TAKEN 20094f0: 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 ) { 20094f4: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 20094f8: 80 a7 20 01 cmp %i4, 1 20094fc: 12 80 00 15 bne 2009550 <_Thread_queue_Requeue+0x6c> <== NEVER TAKEN 2009500: 01 00 00 00 nop Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 2009504: 7f ff e3 1e call 200217c 2009508: 01 00 00 00 nop 200950c: ba 10 00 08 mov %o0, %i5 2009510: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 2009514: 03 00 00 ef sethi %hi(0x3bc00), %g1 2009518: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 200951c: 80 88 80 01 btst %g2, %g1 2009520: 02 80 00 0a be 2009548 <_Thread_queue_Requeue+0x64> <== NEVER TAKEN 2009524: 90 10 00 18 mov %i0, %o0 _Thread_queue_Enter_critical_section( tq ); _Thread_queue_Extract_priority_helper( tq, the_thread, true ); 2009528: 92 10 00 19 mov %i1, %o1 200952c: 94 10 20 01 mov 1, %o2 2009530: 40 00 0d f8 call 200cd10 <_Thread_queue_Extract_priority_helper> 2009534: f8 26 20 30 st %i4, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 2009538: 90 10 00 18 mov %i0, %o0 200953c: 92 10 00 19 mov %i1, %o1 2009540: 7f ff ff 50 call 2009280 <_Thread_queue_Enqueue_priority> 2009544: 94 07 bf fc add %fp, -4, %o2 } _ISR_Enable( level ); 2009548: 7f ff e3 11 call 200218c 200954c: 90 10 00 1d mov %i5, %o0 2009550: 81 c7 e0 08 ret 2009554: 81 e8 00 00 restore =============================================================================== 02009558 <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 2009558: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200955c: 90 10 00 18 mov %i0, %o0 2009560: 7f ff fd f5 call 2008d34 <_Thread_Get> 2009564: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2009568: c2 07 bf fc ld [ %fp + -4 ], %g1 200956c: 80 a0 60 00 cmp %g1, 0 2009570: 12 80 00 09 bne 2009594 <_Thread_queue_Timeout+0x3c> <== NEVER TAKEN 2009574: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 2009578: 40 00 0e 1d call 200cdec <_Thread_queue_Process_timeout> 200957c: 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--; 2009580: 03 00 80 72 sethi %hi(0x201c800), %g1 2009584: c4 00 62 b0 ld [ %g1 + 0x2b0 ], %g2 ! 201cab0 <_Thread_Dispatch_disable_level> 2009588: 84 00 bf ff add %g2, -1, %g2 200958c: c4 20 62 b0 st %g2, [ %g1 + 0x2b0 ] return _Thread_Dispatch_disable_level; 2009590: c2 00 62 b0 ld [ %g1 + 0x2b0 ], %g1 2009594: 81 c7 e0 08 ret 2009598: 81 e8 00 00 restore =============================================================================== 0201718c <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 201718c: 9d e3 bf 88 save %sp, -120, %sp static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 2017190: 27 00 80 ee sethi %hi(0x203b800), %l3 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2017194: a8 07 bf e8 add %fp, -24, %l4 2017198: a4 07 bf ec add %fp, -20, %l2 201719c: b6 07 bf f4 add %fp, -12, %i3 20171a0: b4 07 bf f8 add %fp, -8, %i2 20171a4: e4 27 bf e8 st %l2, [ %fp + -24 ] head->previous = NULL; 20171a8: c0 27 bf ec clr [ %fp + -20 ] tail->previous = head; 20171ac: e8 27 bf f0 st %l4, [ %fp + -16 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 20171b0: f4 27 bf f4 st %i2, [ %fp + -12 ] head->previous = NULL; 20171b4: c0 27 bf f8 clr [ %fp + -8 ] tail->previous = head; 20171b8: f6 27 bf fc st %i3, [ %fp + -4 ] */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20171bc: b2 06 20 30 add %i0, 0x30, %i1 /* * 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 ); 20171c0: b8 06 20 68 add %i0, 0x68, %i4 static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 20171c4: a2 06 20 08 add %i0, 8, %l1 static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 20171c8: a0 06 20 40 add %i0, 0x40, %l0 { /* * 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; 20171cc: e8 26 20 78 st %l4, [ %i0 + 0x78 ] static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 20171d0: 2b 00 80 ed sethi %hi(0x203b400), %l5 static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 20171d4: c2 04 e0 2c ld [ %l3 + 0x2c ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 20171d8: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20171dc: 94 10 00 1b mov %i3, %o2 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 20171e0: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20171e4: 90 10 00 19 mov %i1, %o0 20171e8: 40 00 11 ed call 201b99c <_Watchdog_Adjust_to_chain> 20171ec: 92 20 40 09 sub %g1, %o1, %o1 Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); Watchdog_Interval last_snapshot = watchdogs->last_snapshot; 20171f0: d4 06 20 74 ld [ %i0 + 0x74 ], %o2 static void _Timer_server_Process_tod_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 20171f4: fa 05 63 ac ld [ %l5 + 0x3ac ], %i5 /* * Process the seconds chain. Start by checking that the Time * of Day (TOD) has not been set backwards. If it has then * we want to adjust the watchdogs->Chain to indicate this. */ if ( snapshot > last_snapshot ) { 20171f8: 80 a7 40 0a cmp %i5, %o2 20171fc: 08 80 00 06 bleu 2017214 <_Timer_server_Body+0x88> 2017200: 92 27 40 0a sub %i5, %o2, %o1 /* * 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 ); 2017204: 90 10 00 1c mov %i4, %o0 2017208: 40 00 11 e5 call 201b99c <_Watchdog_Adjust_to_chain> 201720c: 94 10 00 1b mov %i3, %o2 2017210: 30 80 00 06 b,a 2017228 <_Timer_server_Body+0x9c> } else if ( snapshot < last_snapshot ) { 2017214: 1a 80 00 05 bcc 2017228 <_Timer_server_Body+0x9c> 2017218: 90 10 00 1c mov %i4, %o0 /* * 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 ); 201721c: 92 10 20 01 mov 1, %o1 2017220: 40 00 11 b8 call 201b900 <_Watchdog_Adjust> 2017224: 94 22 80 1d sub %o2, %i5, %o2 } watchdogs->last_snapshot = snapshot; 2017228: fa 26 20 74 st %i5, [ %i0 + 0x74 ] } static void _Timer_server_Process_insertions( Timer_server_Control *ts ) { while ( true ) { Timer_Control *timer = (Timer_Control *) _Chain_Get( ts->insert_chain ); 201722c: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2017230: 40 00 02 d9 call 2017d94 <_Chain_Get> 2017234: 01 00 00 00 nop if ( timer == NULL ) { 2017238: 92 92 20 00 orcc %o0, 0, %o1 201723c: 02 80 00 0c be 201726c <_Timer_server_Body+0xe0> 2017240: 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 ) { 2017244: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 2017248: 80 a0 60 01 cmp %g1, 1 201724c: 02 80 00 05 be 2017260 <_Timer_server_Body+0xd4> 2017250: 90 10 00 19 mov %i1, %o0 _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 2017254: 80 a0 60 03 cmp %g1, 3 2017258: 12 bf ff f5 bne 201722c <_Timer_server_Body+0xa0> <== NEVER TAKEN 201725c: 90 10 00 1c mov %i4, %o0 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2017260: 40 00 12 01 call 201ba64 <_Watchdog_Insert> 2017264: 92 02 60 10 add %o1, 0x10, %o1 2017268: 30 bf ff f1 b,a 201722c <_Timer_server_Body+0xa0> * of zero it will be processed in the next iteration of the timer server * body loop. */ _Timer_server_Process_insertions( ts ); _ISR_Disable( level ); 201726c: 7f ff e3 95 call 20100c0 2017270: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 2017274: c2 07 bf e8 ld [ %fp + -24 ], %g1 2017278: 80 a0 40 12 cmp %g1, %l2 201727c: 12 80 00 0a bne 20172a4 <_Timer_server_Body+0x118> <== NEVER TAKEN 2017280: 01 00 00 00 nop ts->insert_chain = NULL; 2017284: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 2017288: 7f ff e3 92 call 20100d0 201728c: 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 ) ) { 2017290: c2 07 bf f4 ld [ %fp + -12 ], %g1 2017294: 80 a0 40 1a cmp %g1, %i2 2017298: 12 80 00 06 bne 20172b0 <_Timer_server_Body+0x124> 201729c: 01 00 00 00 nop 20172a0: 30 80 00 18 b,a 2017300 <_Timer_server_Body+0x174> ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 20172a4: 7f ff e3 8b call 20100d0 <== NOT EXECUTED 20172a8: 01 00 00 00 nop <== NOT EXECUTED 20172ac: 30 bf ff ca b,a 20171d4 <_Timer_server_Body+0x48> <== NOT EXECUTED /* * It is essential that interrupts are disable here since an interrupt * service routine may remove a watchdog from the chain. */ _ISR_Disable( level ); 20172b0: 7f ff e3 84 call 20100c0 20172b4: 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; 20172b8: fa 07 bf f4 ld [ %fp + -12 ], %i5 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_Get_unprotected( Chain_Control *the_chain ) { if ( !_Chain_Is_empty(the_chain)) 20172bc: 80 a7 40 1a cmp %i5, %i2 20172c0: 02 80 00 0d be 20172f4 <_Timer_server_Body+0x168> 20172c4: 01 00 00 00 nop Chain_Control *the_chain ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *old_first = head->next; Chain_Node *new_first = old_first->next; 20172c8: c2 07 40 00 ld [ %i5 ], %g1 head->next = new_first; new_first->previous = head; 20172cc: f6 20 60 04 st %i3, [ %g1 + 4 ] { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *old_first = head->next; Chain_Node *new_first = old_first->next; head->next = new_first; 20172d0: c2 27 bf f4 st %g1, [ %fp + -12 ] watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; 20172d4: c0 27 60 08 clr [ %i5 + 8 ] _ISR_Enable( level ); 20172d8: 7f ff e3 7e call 20100d0 20172dc: 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 ); 20172e0: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 20172e4: d0 07 60 20 ld [ %i5 + 0x20 ], %o0 20172e8: 9f c0 40 00 call %g1 20172ec: d2 07 60 24 ld [ %i5 + 0x24 ], %o1 } 20172f0: 30 bf ff f0 b,a 20172b0 <_Timer_server_Body+0x124> watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; _ISR_Enable( level ); } else { _ISR_Enable( level ); 20172f4: 7f ff e3 77 call 20100d0 20172f8: 01 00 00 00 nop 20172fc: 30 bf ff b4 b,a 20171cc <_Timer_server_Body+0x40> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 2017300: c0 2e 20 7c clrb [ %i0 + 0x7c ] /* * Block until there is something to do. */ _Thread_Disable_dispatch(); 2017304: 7f ff ff 73 call 20170d0 <_Thread_Disable_dispatch> 2017308: 01 00 00 00 nop _Thread_Set_state( ts->thread, STATES_DELAYING ); 201730c: d0 06 00 00 ld [ %i0 ], %o0 2017310: 40 00 10 02 call 201b318 <_Thread_Set_state> 2017314: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 2017318: 7f ff ff 75 call 20170ec <_Timer_server_Reset_interval_system_watchdog> 201731c: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 2017320: 7f ff ff 87 call 201713c <_Timer_server_Reset_tod_system_watchdog> 2017324: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 2017328: 40 00 0d aa call 201a9d0 <_Thread_Enable_dispatch> 201732c: 01 00 00 00 nop ts->active = true; 2017330: 82 10 20 01 mov 1, %g1 ! 1 static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 2017334: 90 10 00 11 mov %l1, %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; 2017338: c2 2e 20 7c stb %g1, [ %i0 + 0x7c ] static void _Timer_server_Stop_interval_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->Interval_watchdogs.System_watchdog ); 201733c: 40 00 12 24 call 201bbcc <_Watchdog_Remove> 2017340: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 2017344: 40 00 12 22 call 201bbcc <_Watchdog_Remove> 2017348: 90 10 00 10 mov %l0, %o0 201734c: 30 bf ff a0 b,a 20171cc <_Timer_server_Body+0x40> =============================================================================== 02017350 <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 2017350: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 2017354: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 2017358: 80 a0 60 00 cmp %g1, 0 201735c: 12 80 00 49 bne 2017480 <_Timer_server_Schedule_operation_method+0x130> 2017360: ba 10 00 19 mov %i1, %i5 * is the reference point for the delta chain. Thus if we do not update the * reference point we have to add DT to the initial delta of the watchdog * being inserted. This could result in an integer overflow. */ _Thread_Disable_dispatch(); 2017364: 7f ff ff 5b call 20170d0 <_Thread_Disable_dispatch> 2017368: 01 00 00 00 nop if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 201736c: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 2017370: 80 a0 60 01 cmp %g1, 1 2017374: 12 80 00 1f bne 20173f0 <_Timer_server_Schedule_operation_method+0xa0> 2017378: 80 a0 60 03 cmp %g1, 3 /* * We have to advance the last known ticks value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); 201737c: 7f ff e3 51 call 20100c0 2017380: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 2017384: 03 00 80 ee sethi %hi(0x203b800), %g1 2017388: c4 00 60 2c ld [ %g1 + 0x2c ], %g2 ! 203b82c <_Watchdog_Ticks_since_boot> */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 201738c: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 last_snapshot = ts->Interval_watchdogs.last_snapshot; 2017390: 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 ); 2017394: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 2017398: 80 a0 40 03 cmp %g1, %g3 201739c: 02 80 00 08 be 20173bc <_Timer_server_Schedule_operation_method+0x6c> 20173a0: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 20173a4: de 00 60 10 ld [ %g1 + 0x10 ], %o7 if (delta_interval > delta) { 20173a8: 80 a3 c0 04 cmp %o7, %g4 20173ac: 08 80 00 03 bleu 20173b8 <_Timer_server_Schedule_operation_method+0x68> 20173b0: 86 10 20 00 clr %g3 delta_interval -= delta; 20173b4: 86 23 c0 04 sub %o7, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 20173b8: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 20173bc: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 20173c0: 7f ff e3 44 call 20100d0 20173c4: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 20173c8: 90 06 20 30 add %i0, 0x30, %o0 20173cc: 40 00 11 a6 call 201ba64 <_Watchdog_Insert> 20173d0: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 20173d4: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 20173d8: 80 a0 60 00 cmp %g1, 0 20173dc: 12 80 00 27 bne 2017478 <_Timer_server_Schedule_operation_method+0x128> 20173e0: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 20173e4: 7f ff ff 42 call 20170ec <_Timer_server_Reset_interval_system_watchdog> 20173e8: 90 10 00 18 mov %i0, %o0 20173ec: 30 80 00 23 b,a 2017478 <_Timer_server_Schedule_operation_method+0x128> } } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 20173f0: 12 80 00 22 bne 2017478 <_Timer_server_Schedule_operation_method+0x128> 20173f4: 01 00 00 00 nop /* * We have to advance the last known seconds value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); 20173f8: 7f ff e3 32 call 20100c0 20173fc: 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; 2017400: c4 06 20 68 ld [ %i0 + 0x68 ], %g2 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; 2017404: de 06 20 74 ld [ %i0 + 0x74 ], %o7 /* * We have to advance the last known seconds value of the server and update * the watchdog chain accordingly. */ _ISR_Disable( level ); snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); 2017408: 03 00 80 ed sethi %hi(0x203b400), %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 201740c: 86 06 20 6c add %i0, 0x6c, %g3 last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 2017410: 80 a0 80 03 cmp %g2, %g3 2017414: 02 80 00 0d be 2017448 <_Timer_server_Schedule_operation_method+0xf8> 2017418: c2 00 63 ac ld [ %g1 + 0x3ac ], %g1 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; 201741c: c8 00 a0 10 ld [ %g2 + 0x10 ], %g4 if ( snapshot > last_snapshot ) { 2017420: 80 a0 40 0f cmp %g1, %o7 } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 2017424: 86 01 00 0f add %g4, %o7, %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 ) { 2017428: 08 80 00 07 bleu 2017444 <_Timer_server_Schedule_operation_method+0xf4> 201742c: 86 20 c0 01 sub %g3, %g1, %g3 /* * We advanced in time. */ delta = snapshot - last_snapshot; 2017430: 9e 20 40 0f sub %g1, %o7, %o7 if (delta_interval > delta) { 2017434: 80 a1 00 0f cmp %g4, %o7 2017438: 08 80 00 03 bleu 2017444 <_Timer_server_Schedule_operation_method+0xf4><== NEVER TAKEN 201743c: 86 10 20 00 clr %g3 delta_interval -= delta; 2017440: 86 21 00 0f sub %g4, %o7, %g3 * Someone put us in the past. */ delta = last_snapshot - snapshot; delta_interval += delta; } first_watchdog->delta_interval = delta_interval; 2017444: c6 20 a0 10 st %g3, [ %g2 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 2017448: c2 26 20 74 st %g1, [ %i0 + 0x74 ] _ISR_Enable( level ); 201744c: 7f ff e3 21 call 20100d0 2017450: 01 00 00 00 nop _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2017454: 90 06 20 68 add %i0, 0x68, %o0 2017458: 40 00 11 83 call 201ba64 <_Watchdog_Insert> 201745c: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 2017460: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2017464: 80 a0 60 00 cmp %g1, 0 2017468: 12 80 00 04 bne 2017478 <_Timer_server_Schedule_operation_method+0x128> 201746c: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 2017470: 7f ff ff 33 call 201713c <_Timer_server_Reset_tod_system_watchdog> 2017474: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 2017478: 40 00 0d 56 call 201a9d0 <_Thread_Enable_dispatch> 201747c: 81 e8 00 00 restore * 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 ); 2017480: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 2017484: 40 00 02 30 call 2017d44 <_Chain_Append> 2017488: 81 e8 00 00 restore =============================================================================== 02009828 <_User_extensions_Handler_initialization>: #include #include #include void _User_extensions_Handler_initialization(void) { 2009828: 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; 200982c: 03 00 80 6f sethi %hi(0x201bc00), %g1 2009830: 82 10 61 4c or %g1, 0x14c, %g1 ! 201bd4c ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2009834: 05 00 80 73 sethi %hi(0x201cc00), %g2 initial_extensions = Configuration.User_extension_table; 2009838: f4 00 60 3c ld [ %g1 + 0x3c ], %i2 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; 200983c: f6 00 60 38 ld [ %g1 + 0x38 ], %i3 2009840: 82 10 a0 98 or %g2, 0x98, %g1 2009844: 86 00 60 04 add %g1, 4, %g3 head->previous = NULL; 2009848: c0 20 60 04 clr [ %g1 + 4 ] tail->previous = head; 200984c: c2 20 60 08 st %g1, [ %g1 + 8 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2009850: c6 20 a0 98 st %g3, [ %g2 + 0x98 ] 2009854: 05 00 80 72 sethi %hi(0x201c800), %g2 2009858: 82 10 a2 b4 or %g2, 0x2b4, %g1 ! 201cab4 <_User_extensions_Switches_list> 200985c: 86 00 60 04 add %g1, 4, %g3 head->previous = NULL; 2009860: c0 20 60 04 clr [ %g1 + 4 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2009864: c6 20 a2 b4 st %g3, [ %g2 + 0x2b4 ] initial_extensions = Configuration.User_extension_table; _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { 2009868: 80 a6 a0 00 cmp %i2, 0 200986c: 02 80 00 1b be 20098d8 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 2009870: c2 20 60 08 st %g1, [ %g1 + 8 ] extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) 2009874: 83 2e e0 02 sll %i3, 2, %g1 2009878: bb 2e e0 04 sll %i3, 4, %i5 200987c: ba 27 40 01 sub %i5, %g1, %i5 2009880: ba 07 40 1b add %i5, %i3, %i5 2009884: bb 2f 60 02 sll %i5, 2, %i5 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) 2009888: 40 00 01 66 call 2009e20 <_Workspace_Allocate_or_fatal_error> 200988c: 90 10 00 1d mov %i5, %o0 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 2009890: 94 10 00 1d mov %i5, %o2 _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { extension = (User_extensions_Control *) 2009894: b8 10 00 08 mov %o0, %i4 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 2009898: 92 10 20 00 clr %o1 200989c: 40 00 17 2e call 200f554 20098a0: ba 10 20 00 clr %i5 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 20098a4: 10 80 00 0b b 20098d0 <_User_extensions_Handler_initialization+0xa8> 20098a8: 80 a7 40 1b cmp %i5, %i3 RTEMS_INLINE_ROUTINE void _User_extensions_Add_set_with_table( User_extensions_Control *extension, const User_extensions_Table *extension_table ) { extension->Callouts = *extension_table; 20098ac: 90 07 20 14 add %i4, 0x14, %o0 20098b0: 92 06 80 09 add %i2, %o1, %o1 20098b4: 40 00 16 ec call 200f464 20098b8: 94 10 20 20 mov 0x20, %o2 _User_extensions_Add_set( extension ); 20098bc: 90 10 00 1c mov %i4, %o0 20098c0: 40 00 0d 8b call 200ceec <_User_extensions_Add_set> 20098c4: ba 07 60 01 inc %i5 _User_extensions_Add_set_with_table (extension, &initial_extensions[i]); extension++; 20098c8: b8 07 20 34 add %i4, 0x34, %i4 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 20098cc: 80 a7 40 1b cmp %i5, %i3 20098d0: 12 bf ff f7 bne 20098ac <_User_extensions_Handler_initialization+0x84> 20098d4: 93 2f 60 05 sll %i5, 5, %o1 20098d8: 81 c7 e0 08 ret 20098dc: 81 e8 00 00 restore =============================================================================== 0200b5a4 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200b5a4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200b5a8: 7f ff de 94 call 2002ff8 200b5ac: 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; 200b5b0: 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 ); 200b5b4: b8 06 20 04 add %i0, 4, %i4 * hence the compiler must not assume *header to remain * unmodified across that call. * * Till Straumann, 7/2003 */ if ( !_Chain_Is_empty( header ) ) { 200b5b8: 80 a0 40 1c cmp %g1, %i4 200b5bc: 02 80 00 1f be 200b638 <_Watchdog_Adjust+0x94> 200b5c0: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200b5c4: 02 80 00 1a be 200b62c <_Watchdog_Adjust+0x88> 200b5c8: b6 10 20 01 mov 1, %i3 200b5cc: 80 a6 60 01 cmp %i1, 1 200b5d0: 12 80 00 1a bne 200b638 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200b5d4: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200b5d8: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200b5dc: 10 80 00 07 b 200b5f8 <_Watchdog_Adjust+0x54> 200b5e0: b4 00 80 1a add %g2, %i2, %i2 break; case WATCHDOG_FORWARD: while ( units ) { if ( units < _Watchdog_First( header )->delta_interval ) { 200b5e4: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200b5e8: 80 a6 80 02 cmp %i2, %g2 200b5ec: 3a 80 00 05 bcc,a 200b600 <_Watchdog_Adjust+0x5c> 200b5f0: f6 20 60 10 st %i3, [ %g1 + 0x10 ] _Watchdog_First( header )->delta_interval -= units; 200b5f4: b4 20 80 1a sub %g2, %i2, %i2 break; 200b5f8: 10 80 00 10 b 200b638 <_Watchdog_Adjust+0x94> 200b5fc: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } else { units -= _Watchdog_First( header )->delta_interval; 200b600: b4 26 80 02 sub %i2, %g2, %i2 _Watchdog_First( header )->delta_interval = 1; _ISR_Enable( level ); 200b604: 7f ff de 81 call 2003008 200b608: 01 00 00 00 nop _Watchdog_Tickle( header ); 200b60c: 40 00 00 90 call 200b84c <_Watchdog_Tickle> 200b610: 90 10 00 1d mov %i5, %o0 _ISR_Disable( level ); 200b614: 7f ff de 79 call 2002ff8 200b618: 01 00 00 00 nop if ( _Chain_Is_empty( header ) ) 200b61c: c2 07 40 00 ld [ %i5 ], %g1 200b620: 80 a0 40 1c cmp %g1, %i4 200b624: 02 80 00 05 be 200b638 <_Watchdog_Adjust+0x94> 200b628: 01 00 00 00 nop switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200b62c: 80 a6 a0 00 cmp %i2, 0 200b630: 32 bf ff ed bne,a 200b5e4 <_Watchdog_Adjust+0x40> <== ALWAYS TAKEN 200b634: c2 07 40 00 ld [ %i5 ], %g1 } break; } } _ISR_Enable( level ); 200b638: 7f ff de 74 call 2003008 200b63c: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02009c40 <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 2009c40: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 2009c44: 7f ff e1 4e call 200217c 2009c48: ba 10 00 18 mov %i0, %i5 previous_state = the_watchdog->state; 2009c4c: f0 06 20 08 ld [ %i0 + 8 ], %i0 switch ( previous_state ) { 2009c50: 80 a6 20 01 cmp %i0, 1 2009c54: 22 80 00 1d be,a 2009cc8 <_Watchdog_Remove+0x88> 2009c58: c0 27 60 08 clr [ %i5 + 8 ] 2009c5c: 0a 80 00 1c bcs 2009ccc <_Watchdog_Remove+0x8c> 2009c60: 03 00 80 72 sethi %hi(0x201c800), %g1 2009c64: 80 a6 20 03 cmp %i0, 3 2009c68: 18 80 00 19 bgu 2009ccc <_Watchdog_Remove+0x8c> <== NEVER TAKEN 2009c6c: 01 00 00 00 nop 2009c70: c2 07 40 00 ld [ %i5 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 2009c74: c0 27 60 08 clr [ %i5 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 2009c78: c4 00 40 00 ld [ %g1 ], %g2 2009c7c: 80 a0 a0 00 cmp %g2, 0 2009c80: 02 80 00 07 be 2009c9c <_Watchdog_Remove+0x5c> 2009c84: 05 00 80 72 sethi %hi(0x201c800), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 2009c88: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 2009c8c: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 2009c90: 84 00 c0 02 add %g3, %g2, %g2 2009c94: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 2009c98: 05 00 80 72 sethi %hi(0x201c800), %g2 2009c9c: c4 00 a3 b8 ld [ %g2 + 0x3b8 ], %g2 ! 201cbb8 <_Watchdog_Sync_count> 2009ca0: 80 a0 a0 00 cmp %g2, 0 2009ca4: 22 80 00 07 be,a 2009cc0 <_Watchdog_Remove+0x80> 2009ca8: c4 07 60 04 ld [ %i5 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 2009cac: 05 00 80 73 sethi %hi(0x201cc00), %g2 2009cb0: c6 00 a3 f0 ld [ %g2 + 0x3f0 ], %g3 ! 201cff0 <_Per_CPU_Information+0x8> 2009cb4: 05 00 80 72 sethi %hi(0x201c800), %g2 2009cb8: c6 20 a3 58 st %g3, [ %g2 + 0x358 ] ! 201cb58 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 2009cbc: c4 07 60 04 ld [ %i5 + 4 ], %g2 next->previous = previous; 2009cc0: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 2009cc4: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 2009cc8: 03 00 80 72 sethi %hi(0x201c800), %g1 2009ccc: c2 00 63 bc ld [ %g1 + 0x3bc ], %g1 ! 201cbbc <_Watchdog_Ticks_since_boot> 2009cd0: c2 27 60 18 st %g1, [ %i5 + 0x18 ] _ISR_Enable( level ); 2009cd4: 7f ff e1 2e call 200218c 2009cd8: 01 00 00 00 nop return( previous_state ); } 2009cdc: 81 c7 e0 08 ret 2009ce0: 81 e8 00 00 restore =============================================================================== 0200ad90 <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200ad90: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200ad94: 7f ff df 69 call 2002b38 200ad98: ba 10 00 18 mov %i0, %i5 200ad9c: b0 10 00 08 mov %o0, %i0 printk( "Watchdog Chain: %s %p\n", name, header ); 200ada0: 11 00 80 72 sethi %hi(0x201c800), %o0 200ada4: 94 10 00 19 mov %i1, %o2 200ada8: 90 12 20 c0 or %o0, 0xc0, %o0 200adac: 7f ff e6 19 call 2004610 200adb0: 92 10 00 1d mov %i5, %o1 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 200adb4: 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 ); 200adb8: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 200adbc: 80 a7 00 19 cmp %i4, %i1 200adc0: 12 80 00 04 bne 200add0 <_Watchdog_Report_chain+0x40> 200adc4: 92 10 00 1c mov %i4, %o1 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 200adc8: 10 80 00 0d b 200adfc <_Watchdog_Report_chain+0x6c> 200adcc: 11 00 80 72 sethi %hi(0x201c800), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 200add0: 40 00 00 0f call 200ae0c <_Watchdog_Report> 200add4: 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 ) 200add8: 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 ) ; 200addc: 80 a7 00 19 cmp %i4, %i1 200ade0: 12 bf ff fc bne 200add0 <_Watchdog_Report_chain+0x40> <== NEVER TAKEN 200ade4: 92 10 00 1c mov %i4, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200ade8: 11 00 80 72 sethi %hi(0x201c800), %o0 200adec: 92 10 00 1d mov %i5, %o1 200adf0: 7f ff e6 08 call 2004610 200adf4: 90 12 20 d8 or %o0, 0xd8, %o0 200adf8: 30 80 00 03 b,a 200ae04 <_Watchdog_Report_chain+0x74> } else { printk( "Chain is empty\n" ); 200adfc: 7f ff e6 05 call 2004610 200ae00: 90 12 20 e8 or %o0, 0xe8, %o0 } _ISR_Enable( level ); 200ae04: 7f ff df 51 call 2002b48 200ae08: 81 e8 00 00 restore =============================================================================== 0200680c : * operation(s) cannot be canceled */ int aio_cancel(int fildes, struct aiocb *aiocbp) { 200680c: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request_chain *r_chain; int result; pthread_mutex_lock (&aio_request_queue.mutex); 2006810: 3b 00 80 62 sethi %hi(0x2018800), %i5 2006814: 40 00 04 5d call 2007988 2006818: 90 17 63 2c or %i5, 0x32c, %o0 ! 2018b2c if (fcntl (fildes, F_GETFD) < 0) { 200681c: 90 10 00 18 mov %i0, %o0 2006820: 40 00 1c 94 call 200da70 2006824: 92 10 20 01 mov 1, %o1 2006828: 80 a2 20 00 cmp %o0, 0 200682c: 16 80 00 08 bge 200684c 2006830: 80 a6 60 00 cmp %i1, 0 pthread_mutex_unlock(&aio_request_queue.mutex); 2006834: 40 00 04 75 call 2007a08 2006838: 90 17 63 2c or %i5, 0x32c, %o0 rtems_set_errno_and_return_minus_one (EBADF); 200683c: 40 00 29 e6 call 2010fd4 <__errno> 2006840: 01 00 00 00 nop 2006844: 10 80 00 4e b 200697c 2006848: 82 10 20 09 mov 9, %g1 ! 9 } /* if aiocbp is NULL remove all request for given file descriptor */ if (aiocbp == NULL) { 200684c: 32 80 00 2f bne,a 2006908 2006850: f8 06 40 00 ld [ %i1 ], %i4 AIO_printf ("Cancel all requests\n"); r_chain = rtems_aio_search_fd (&aio_request_queue.work_req, fildes, 0); 2006854: 11 00 80 62 sethi %hi(0x2018800), %o0 2006858: 92 10 00 18 mov %i0, %o1 200685c: 90 12 23 74 or %o0, 0x374, %o0 2006860: 40 00 00 bb call 2006b4c 2006864: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2006868: b8 92 20 00 orcc %o0, 0, %i4 200686c: 32 80 00 1a bne,a 20068d4 2006870: b2 07 20 1c add %i4, 0x1c, %i1 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2006874: ba 17 63 2c or %i5, 0x32c, %i5 AIO_printf ("Request chain not on [WQ]\n"); if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2006878: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 200687c: 82 07 60 58 add %i5, 0x58, %g1 2006880: 80 a0 80 01 cmp %g2, %g1 2006884: 02 80 00 48 be 20069a4 <== NEVER TAKEN 2006888: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 200688c: 92 10 00 18 mov %i0, %o1 2006890: 40 00 00 af call 2006b4c 2006894: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2006898: b8 92 20 00 orcc %o0, 0, %i4 200689c: 22 80 00 43 be,a 20069a8 20068a0: 90 10 00 1d mov %i5, %o0 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 20068a4: 40 00 0a a8 call 2009344 <_Chain_Extract> 20068a8: 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); 20068ac: 40 00 01 8d call 2006ee0 20068b0: 90 10 00 1c mov %i4, %o0 pthread_mutex_destroy (&r_chain->mutex); 20068b4: 40 00 03 90 call 20076f4 20068b8: 90 10 00 19 mov %i1, %o0 pthread_cond_destroy (&r_chain->mutex); 20068bc: 40 00 02 b5 call 2007390 20068c0: 90 10 00 19 mov %i1, %o0 free (r_chain); 20068c4: 7f ff f3 31 call 2003588 20068c8: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 20068cc: 10 80 00 0b b 20068f8 20068d0: 90 10 00 1d mov %i5, %o0 return AIO_ALLDONE; } AIO_printf ("Request chain on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 20068d4: 40 00 04 2d call 2007988 20068d8: 90 10 00 19 mov %i1, %o0 20068dc: 40 00 0a 9a call 2009344 <_Chain_Extract> 20068e0: 90 10 00 1c mov %i4, %o0 rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 20068e4: 40 00 01 7f call 2006ee0 20068e8: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&r_chain->mutex); 20068ec: 40 00 04 47 call 2007a08 20068f0: 90 10 00 19 mov %i1, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 20068f4: 90 17 63 2c or %i5, 0x32c, %o0 20068f8: 40 00 04 44 call 2007a08 20068fc: b0 10 20 00 clr %i0 return AIO_CANCELED; 2006900: 81 c7 e0 08 ret 2006904: 81 e8 00 00 restore } else { AIO_printf ("Cancel request\n"); if (aiocbp->aio_fildes != fildes) { 2006908: 80 a7 00 18 cmp %i4, %i0 200690c: 12 80 00 17 bne 2006968 2006910: 90 17 63 2c or %i5, 0x32c, %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); 2006914: 11 00 80 62 sethi %hi(0x2018800), %o0 2006918: 92 10 00 1c mov %i4, %o1 200691c: 90 12 23 74 or %o0, 0x374, %o0 2006920: 40 00 00 8b call 2006b4c 2006924: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2006928: b0 92 20 00 orcc %o0, 0, %i0 200692c: 32 80 00 23 bne,a 20069b8 2006930: b8 06 20 1c add %i0, 0x1c, %i4 2006934: ba 17 63 2c or %i5, 0x32c, %i5 if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2006938: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 200693c: 82 07 60 58 add %i5, 0x58, %g1 2006940: 80 a0 80 01 cmp %g2, %g1 2006944: 02 80 00 18 be 20069a4 <== NEVER TAKEN 2006948: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 200694c: 92 10 00 1c mov %i4, %o1 2006950: 40 00 00 7f call 2006b4c 2006954: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2006958: 80 a2 20 00 cmp %o0, 0 200695c: 12 80 00 0b bne 2006988 2006960: 92 10 00 19 mov %i1, %o1 pthread_mutex_unlock (&aio_request_queue.mutex); 2006964: 90 10 00 1d mov %i5, %o0 2006968: 40 00 04 28 call 2007a08 200696c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one (EINVAL); 2006970: 40 00 29 99 call 2010fd4 <__errno> 2006974: 01 00 00 00 nop 2006978: 82 10 20 16 mov 0x16, %g1 ! 16 200697c: c2 22 00 00 st %g1, [ %o0 ] 2006980: 81 c7 e0 08 ret 2006984: 91 e8 3f ff restore %g0, -1, %o0 } AIO_printf ("Request on [IQ]\n"); result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2006988: 40 00 01 6a call 2006f30 200698c: 90 02 20 08 add %o0, 8, %o0 2006990: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&aio_request_queue.mutex); 2006994: 40 00 04 1d call 2007a08 2006998: 90 10 00 1d mov %i5, %o0 return result; 200699c: 81 c7 e0 08 ret 20069a0: 81 e8 00 00 restore } else { pthread_mutex_unlock (&aio_request_queue.mutex); 20069a4: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 20069a8: 40 00 04 18 call 2007a08 20069ac: b0 10 20 02 mov 2, %i0 return AIO_ALLDONE; 20069b0: 81 c7 e0 08 ret 20069b4: 81 e8 00 00 restore } } AIO_printf ("Request on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 20069b8: 40 00 03 f4 call 2007988 20069bc: 90 10 00 1c mov %i4, %o0 result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 20069c0: 92 10 00 19 mov %i1, %o1 20069c4: 40 00 01 5b call 2006f30 20069c8: 90 06 20 08 add %i0, 8, %o0 20069cc: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&r_chain->mutex); 20069d0: 40 00 04 0e call 2007a08 20069d4: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 20069d8: 40 00 04 0c call 2007a08 20069dc: 90 17 63 2c or %i5, 0x32c, %o0 return result; } return AIO_ALLDONE; } 20069e0: 81 c7 e0 08 ret 20069e4: 81 e8 00 00 restore =============================================================================== 020069f0 : int aio_fsync( int op, struct aiocb *aiocbp ) { 20069f0: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; if (op != O_SYNC) 20069f4: 03 00 00 08 sethi %hi(0x2000), %g1 20069f8: 80 a6 00 01 cmp %i0, %g1 20069fc: 12 80 00 10 bne 2006a3c 2006a00: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2006a04: d0 06 40 00 ld [ %i1 ], %o0 2006a08: 40 00 1c 1a call 200da70 2006a0c: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 2006a10: 90 0a 20 03 and %o0, 3, %o0 2006a14: 90 02 3f ff add %o0, -1, %o0 2006a18: 80 a2 20 01 cmp %o0, 1 2006a1c: 18 80 00 08 bgu 2006a3c 2006a20: ba 10 20 09 mov 9, %i5 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2006a24: 7f ff f4 51 call 2003b68 2006a28: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2006a2c: 80 a2 20 00 cmp %o0, 0 2006a30: 32 80 00 0b bne,a 2006a5c <== ALWAYS TAKEN 2006a34: f2 22 20 14 st %i1, [ %o0 + 0x14 ] rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 2006a38: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED 2006a3c: 82 10 3f ff mov -1, %g1 2006a40: fa 26 60 34 st %i5, [ %i1 + 0x34 ] 2006a44: c2 26 60 38 st %g1, [ %i1 + 0x38 ] 2006a48: 40 00 29 63 call 2010fd4 <__errno> 2006a4c: b0 10 3f ff mov -1, %i0 2006a50: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_SYNC; return rtems_aio_enqueue (req); } 2006a54: 81 c7 e0 08 ret 2006a58: 81 e8 00 00 restore req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_SYNC; 2006a5c: 82 10 20 03 mov 3, %g1 2006a60: c2 26 60 30 st %g1, [ %i1 + 0x30 ] return rtems_aio_enqueue (req); 2006a64: 40 00 01 50 call 2006fa4 2006a68: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 020071d4 : * 0 - otherwise */ int aio_read (struct aiocb *aiocbp) { 20071d4: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 20071d8: d0 06 00 00 ld [ %i0 ], %o0 20071dc: 40 00 1a 25 call 200da70 20071e0: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR))) 20071e4: 90 0a 20 03 and %o0, 3, %o0 20071e8: 80 a2 20 02 cmp %o0, 2 20071ec: 02 80 00 05 be 2007200 20071f0: ba 10 00 18 mov %i0, %i5 20071f4: 80 a2 20 00 cmp %o0, 0 20071f8: 12 80 00 10 bne 2007238 <== ALWAYS TAKEN 20071fc: b8 10 20 09 mov 9, %i4 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) 2007200: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 2007204: 80 a0 60 00 cmp %g1, 0 2007208: 32 80 00 0c bne,a 2007238 200720c: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 2007210: c2 07 60 08 ld [ %i5 + 8 ], %g1 2007214: 80 a0 60 00 cmp %g1, 0 2007218: 26 80 00 08 bl,a 2007238 200721c: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2007220: 7f ff f2 52 call 2003b68 2007224: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2007228: 80 a2 20 00 cmp %o0, 0 200722c: 32 80 00 0b bne,a 2007258 <== ALWAYS TAKEN 2007230: fa 22 20 14 st %i5, [ %o0 + 0x14 ] 2007234: b8 10 20 0b mov 0xb, %i4 <== NOT EXECUTED rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 2007238: 82 10 3f ff mov -1, %g1 200723c: f8 27 60 34 st %i4, [ %i5 + 0x34 ] 2007240: c2 27 60 38 st %g1, [ %i5 + 0x38 ] 2007244: 40 00 27 64 call 2010fd4 <__errno> 2007248: b0 10 3f ff mov -1, %i0 200724c: f8 22 00 00 st %i4, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_READ; return rtems_aio_enqueue (req); } 2007250: 81 c7 e0 08 ret 2007254: 81 e8 00 00 restore req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_READ; 2007258: 82 10 20 01 mov 1, %g1 200725c: c2 27 60 30 st %g1, [ %i5 + 0x30 ] return rtems_aio_enqueue (req); 2007260: 7f ff ff 51 call 2006fa4 2007264: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02007270 : * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 2007270: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2007274: d0 06 00 00 ld [ %i0 ], %o0 2007278: 40 00 19 fe call 200da70 200727c: 92 10 20 03 mov 3, %o1 * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 2007280: ba 10 00 18 mov %i0, %i5 rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 2007284: 90 0a 20 03 and %o0, 3, %o0 2007288: 90 02 3f ff add %o0, -1, %o0 200728c: 80 a2 20 01 cmp %o0, 1 2007290: 18 80 00 10 bgu 20072d0 2007294: b8 10 20 09 mov 9, %i4 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); if (aiocbp->aio_reqprio < 0 || aiocbp->aio_reqprio > AIO_PRIO_DELTA_MAX) 2007298: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200729c: 80 a0 60 00 cmp %g1, 0 20072a0: 32 80 00 0c bne,a 20072d0 20072a4: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 20072a8: c2 06 20 08 ld [ %i0 + 8 ], %g1 20072ac: 80 a0 60 00 cmp %g1, 0 20072b0: 26 80 00 08 bl,a 20072d0 20072b4: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 20072b8: 7f ff f2 2c call 2003b68 20072bc: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 20072c0: 80 a2 20 00 cmp %o0, 0 20072c4: 32 80 00 0b bne,a 20072f0 <== ALWAYS TAKEN 20072c8: f0 22 20 14 st %i0, [ %o0 + 0x14 ] 20072cc: b8 10 20 0b mov 0xb, %i4 <== NOT EXECUTED rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 20072d0: 82 10 3f ff mov -1, %g1 20072d4: f8 27 60 34 st %i4, [ %i5 + 0x34 ] 20072d8: c2 27 60 38 st %g1, [ %i5 + 0x38 ] 20072dc: 40 00 27 3e call 2010fd4 <__errno> 20072e0: b0 10 3f ff mov -1, %i0 20072e4: f8 22 00 00 st %i4, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_WRITE; return rtems_aio_enqueue (req); } 20072e8: 81 c7 e0 08 ret 20072ec: 81 e8 00 00 restore req = malloc (sizeof (rtems_aio_request)); if (req == NULL) rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_WRITE; 20072f0: 82 10 20 02 mov 2, %g1 20072f4: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 20072f8: 7f ff ff 2b call 2006fa4 20072fc: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02005e40 : int clock_gettime( clockid_t clock_id, struct timespec *tp ) { 2005e40: 9d e3 bf a0 save %sp, -96, %sp if ( !tp ) 2005e44: 90 96 60 00 orcc %i1, 0, %o0 2005e48: 12 80 00 06 bne 2005e60 2005e4c: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); 2005e50: 40 00 26 39 call 200f734 <__errno> 2005e54: 01 00 00 00 nop 2005e58: 10 80 00 15 b 2005eac 2005e5c: 82 10 20 16 mov 0x16, %g1 ! 16 if ( clock_id == CLOCK_REALTIME ) { 2005e60: 12 80 00 05 bne 2005e74 2005e64: 80 a6 20 04 cmp %i0, 4 _TOD_Get(tp); 2005e68: 40 00 07 ca call 2007d90 <_TOD_Get> 2005e6c: b0 10 20 00 clr %i0 2005e70: 30 80 00 16 b,a 2005ec8 return 0; } #ifdef CLOCK_MONOTONIC if ( clock_id == CLOCK_MONOTONIC ) { 2005e74: 02 80 00 05 be 2005e88 <== NEVER TAKEN 2005e78: 01 00 00 00 nop return 0; } #endif #ifdef _POSIX_CPUTIME if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) { 2005e7c: 80 a6 20 02 cmp %i0, 2 2005e80: 12 80 00 06 bne 2005e98 2005e84: 80 a6 20 03 cmp %i0, 3 _TOD_Get_uptime_as_timespec( tp ); 2005e88: 40 00 07 de call 2007e00 <_TOD_Get_uptime_as_timespec> 2005e8c: b0 10 20 00 clr %i0 return 0; 2005e90: 81 c7 e0 08 ret 2005e94: 81 e8 00 00 restore } #endif #ifdef _POSIX_THREAD_CPUTIME if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) 2005e98: 12 80 00 08 bne 2005eb8 2005e9c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); 2005ea0: 40 00 26 25 call 200f734 <__errno> 2005ea4: 01 00 00 00 nop 2005ea8: 82 10 20 58 mov 0x58, %g1 ! 58 2005eac: c2 22 00 00 st %g1, [ %o0 ] 2005eb0: 81 c7 e0 08 ret 2005eb4: 91 e8 3f ff restore %g0, -1, %o0 #endif rtems_set_errno_and_return_minus_one( EINVAL ); 2005eb8: 40 00 26 1f call 200f734 <__errno> 2005ebc: b0 10 3f ff mov -1, %i0 2005ec0: 82 10 20 16 mov 0x16, %g1 2005ec4: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2005ec8: 81 c7 e0 08 ret 2005ecc: 81 e8 00 00 restore =============================================================================== 02005ed0 : int clock_settime( clockid_t clock_id, const struct timespec *tp ) { 2005ed0: 9d e3 bf a0 save %sp, -96, %sp if ( !tp ) 2005ed4: 90 96 60 00 orcc %i1, 0, %o0 2005ed8: 02 80 00 0b be 2005f04 <== NEVER TAKEN 2005edc: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 2005ee0: 80 a6 20 01 cmp %i0, 1 2005ee4: 12 80 00 16 bne 2005f3c 2005ee8: 80 a6 20 02 cmp %i0, 2 if ( tp->tv_sec < TOD_SECONDS_1970_THROUGH_1988 ) 2005eec: c4 02 00 00 ld [ %o0 ], %g2 2005ef0: 03 08 76 b9 sethi %hi(0x21dae400), %g1 2005ef4: 82 10 60 ff or %g1, 0xff, %g1 ! 21dae4ff 2005ef8: 80 a0 80 01 cmp %g2, %g1 2005efc: 38 80 00 06 bgu,a 2005f14 2005f00: 03 00 80 65 sethi %hi(0x2019400), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 2005f04: 40 00 26 0c call 200f734 <__errno> 2005f08: 01 00 00 00 nop 2005f0c: 10 80 00 14 b 2005f5c 2005f10: 82 10 20 16 mov 0x16, %g1 ! 16 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2005f14: c4 00 61 50 ld [ %g1 + 0x150 ], %g2 2005f18: 84 00 a0 01 inc %g2 2005f1c: c4 20 61 50 st %g2, [ %g1 + 0x150 ] return _Thread_Dispatch_disable_level; 2005f20: c2 00 61 50 ld [ %g1 + 0x150 ], %g1 _Thread_Disable_dispatch(); _TOD_Set( tp ); 2005f24: 40 00 07 cd call 2007e58 <_TOD_Set> 2005f28: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 2005f2c: 40 00 0e 01 call 2009730 <_Thread_Enable_dispatch> 2005f30: 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; 2005f34: 81 c7 e0 08 ret 2005f38: 81 e8 00 00 restore _Thread_Disable_dispatch(); _TOD_Set( tp ); _Thread_Enable_dispatch(); } #ifdef _POSIX_CPUTIME else if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) 2005f3c: 02 80 00 05 be 2005f50 2005f40: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); #endif #ifdef _POSIX_THREAD_CPUTIME else if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) 2005f44: 80 a6 20 03 cmp %i0, 3 2005f48: 12 80 00 08 bne 2005f68 2005f4c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); 2005f50: 40 00 25 f9 call 200f734 <__errno> 2005f54: 01 00 00 00 nop 2005f58: 82 10 20 58 mov 0x58, %g1 ! 58 2005f5c: c2 22 00 00 st %g1, [ %o0 ] 2005f60: 81 c7 e0 08 ret 2005f64: 91 e8 3f ff restore %g0, -1, %o0 #endif else rtems_set_errno_and_return_minus_one( EINVAL ); 2005f68: 40 00 25 f3 call 200f734 <__errno> 2005f6c: b0 10 3f ff mov -1, %i0 2005f70: 82 10 20 16 mov 0x16, %g1 2005f74: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2005f78: 81 c7 e0 08 ret 2005f7c: 81 e8 00 00 restore =============================================================================== 020194c4 : int killinfo( pid_t pid, int sig, const union sigval *value ) { 20194c4: 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() ) 20194c8: 7f ff fe f2 call 2019090 20194cc: 01 00 00 00 nop 20194d0: 80 a6 00 08 cmp %i0, %o0 20194d4: 02 80 00 06 be 20194ec 20194d8: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); 20194dc: 7f ff d5 86 call 200eaf4 <__errno> 20194e0: 01 00 00 00 nop 20194e4: 10 80 00 a5 b 2019778 20194e8: 82 10 20 03 mov 3, %g1 ! 3 /* * Validate the signal passed. */ if ( !sig ) 20194ec: 02 80 00 06 be 2019504 20194f0: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 20194f4: ba 06 7f ff add %i1, -1, %i5 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 20194f8: 80 a7 60 1f cmp %i5, 0x1f 20194fc: 28 80 00 06 bleu,a 2019514 2019500: 83 2e 60 02 sll %i1, 2, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 2019504: 7f ff d5 7c call 200eaf4 <__errno> 2019508: 01 00 00 00 nop 201950c: 10 80 00 9b b 2019778 2019510: 82 10 20 16 mov 0x16, %g1 ! 16 /* * If the signal is being ignored, then we are out of here. */ if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) 2019514: 85 2e 60 04 sll %i1, 4, %g2 2019518: 84 20 80 01 sub %g2, %g1, %g2 201951c: 03 00 80 74 sethi %hi(0x201d000), %g1 2019520: 82 10 60 40 or %g1, 0x40, %g1 ! 201d040 <_POSIX_signals_Vectors> 2019524: 82 00 40 02 add %g1, %g2, %g1 2019528: c2 00 60 08 ld [ %g1 + 8 ], %g1 201952c: 80 a0 60 01 cmp %g1, 1 2019530: 02 80 00 7b be 201971c 2019534: 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 ) ) 2019538: 80 a6 60 04 cmp %i1, 4 201953c: 02 80 00 06 be 2019554 2019540: 80 a6 60 08 cmp %i1, 8 2019544: 02 80 00 04 be 2019554 2019548: 80 a6 60 0b cmp %i1, 0xb 201954c: 12 80 00 08 bne 201956c 2019550: 82 10 20 01 mov 1, %g1 return pthread_kill( pthread_self(), sig ); 2019554: 40 00 01 2e call 2019a0c 2019558: 01 00 00 00 nop 201955c: 40 00 00 f2 call 2019924 2019560: 92 10 00 19 mov %i1, %o1 2019564: 81 c7 e0 08 ret 2019568: 91 e8 00 08 restore %g0, %o0, %o0 /* * Build up a siginfo structure */ siginfo = &siginfo_struct; siginfo->si_signo = sig; 201956c: f2 27 bf f4 st %i1, [ %fp + -12 ] siginfo->si_code = SI_USER; 2019570: c2 27 bf f8 st %g1, [ %fp + -8 ] if ( !value ) { 2019574: 80 a6 a0 00 cmp %i2, 0 2019578: 12 80 00 04 bne 2019588 201957c: bb 28 40 1d sll %g1, %i5, %i5 siginfo->si_value.sival_int = 0; 2019580: 10 80 00 04 b 2019590 2019584: c0 27 bf fc clr [ %fp + -4 ] } else { siginfo->si_value = *value; 2019588: c2 06 80 00 ld [ %i2 ], %g1 201958c: 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++; 2019590: 03 00 80 72 sethi %hi(0x201c800), %g1 2019594: c4 00 62 b0 ld [ %g1 + 0x2b0 ], %g2 ! 201cab0 <_Thread_Dispatch_disable_level> 2019598: 84 00 a0 01 inc %g2 201959c: c4 20 62 b0 st %g2, [ %g1 + 0x2b0 ] return _Thread_Dispatch_disable_level; 20195a0: c2 00 62 b0 ld [ %g1 + 0x2b0 ], %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; 20195a4: 03 00 80 73 sethi %hi(0x201cc00), %g1 20195a8: d0 00 63 f4 ld [ %g1 + 0x3f4 ], %o0 ! 201cff4 <_Per_CPU_Information+0xc> api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( _POSIX_signals_Is_interested( api, mask ) ) { 20195ac: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 20195b0: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 20195b4: 80 af 40 01 andncc %i5, %g1, %g0 20195b8: 12 80 00 51 bne 20196fc 20195bc: 03 00 80 74 sethi %hi(0x201d000), %g1 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 20195c0: d0 00 61 cc ld [ %g1 + 0x1cc ], %o0 ! 201d1cc <_POSIX_signals_Wait_queue> /* 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 ); 20195c4: 03 00 80 74 sethi %hi(0x201d000), %g1 20195c8: 10 80 00 0a b 20195f0 20195cc: 82 10 61 d0 or %g1, 0x1d0, %g1 ! 201d1d0 <_POSIX_signals_Wait_queue+0x4> #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 20195d0: 80 8f 40 03 btst %i5, %g3 20195d4: 12 80 00 4a bne 20196fc 20195d8: c4 02 21 5c ld [ %o0 + 0x15c ], %g2 /* * Is this thread is blocked waiting for another signal but has * not blocked this one? */ if (~api->signals_blocked & mask) 20195dc: c4 00 a0 d0 ld [ %g2 + 0xd0 ], %g2 20195e0: 80 af 40 02 andncc %i5, %g2, %g0 20195e4: 12 80 00 47 bne 2019700 20195e8: 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 ) { 20195ec: 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 ); 20195f0: 80 a2 00 01 cmp %o0, %g1 20195f4: 32 bf ff f7 bne,a 20195d0 20195f8: c6 02 20 30 ld [ %o0 + 0x30 ], %g3 * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 20195fc: 03 00 80 6f sethi %hi(0x201bc00), %g1 2019600: c4 08 61 8c ldub [ %g1 + 0x18c ], %g2 ! 201bd8c * * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; 2019604: 90 10 20 00 clr %o0 interested_priority = PRIORITY_MAXIMUM + 1; 2019608: 84 00 a0 01 inc %g2 for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) { 201960c: 88 10 20 02 mov 2, %g4 /* * This can occur when no one is interested and an API is not configured. */ if ( !_Objects_Information_table[ the_api ] ) 2019610: 19 00 80 72 sethi %hi(0x201c800), %o4 */ RTEMS_INLINE_ROUTINE bool _States_Is_interruptible_by_signal ( States_Control the_states ) { return (the_states & STATES_INTERRUPTIBLE_BY_SIGNAL); 2019614: 31 04 00 00 sethi %hi(0x10000000), %i0 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 2019618: 83 29 20 02 sll %g4, 2, %g1 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 ] ) 201961c: 86 13 22 18 or %o4, 0x218, %g3 2019620: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 2019624: 80 a0 60 00 cmp %g1, 0 2019628: 22 80 00 2f be,a 20196e4 <== NEVER TAKEN 201962c: 88 01 20 01 inc %g4 <== NOT EXECUTED continue; the_info = _Objects_Information_table[ the_api ][ 1 ]; 2019630: c2 00 60 04 ld [ %g1 + 4 ], %g1 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 2019634: b4 10 20 01 mov 1, %i2 */ if ( !the_info ) continue; #endif maximum = the_info->maximum; 2019638: d4 10 60 10 lduh [ %g1 + 0x10 ], %o2 object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 201963c: 10 80 00 26 b 20196d4 2019640: d6 00 60 1c ld [ %g1 + 0x1c ], %o3 the_thread = (Thread_Control *) object_table[ index ]; 2019644: c2 02 c0 01 ld [ %o3 + %g1 ], %g1 if ( !the_thread ) 2019648: 80 a0 60 00 cmp %g1, 0 201964c: 22 80 00 22 be,a 20196d4 2019650: b4 06 a0 01 inc %i2 /* * If this thread is of lower priority than the interested thread, * go on to the next thread. */ if ( the_thread->current_priority > interested_priority ) 2019654: c6 00 60 14 ld [ %g1 + 0x14 ], %g3 2019658: 80 a0 c0 02 cmp %g3, %g2 201965c: 38 80 00 1e bgu,a 20196d4 2019660: b4 06 a0 01 inc %i2 #if defined(RTEMS_DEBUG) if ( !api ) continue; #endif if ( !_POSIX_signals_Is_interested( api, mask ) ) 2019664: de 00 61 5c ld [ %g1 + 0x15c ], %o7 2019668: de 03 e0 d0 ld [ %o7 + 0xd0 ], %o7 201966c: 80 af 40 0f andncc %i5, %o7, %g0 2019670: 22 80 00 19 be,a 20196d4 2019674: b4 06 a0 01 inc %i2 * * 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 ) { 2019678: 80 a0 c0 02 cmp %g3, %g2 201967c: 2a 80 00 14 bcs,a 20196cc 2019680: 84 10 00 03 mov %g3, %g2 * and blocking interruptibutable by signal. * * If the interested thread is ready, don't think about changing. */ if ( interested && !_States_Is_ready( interested->current_state ) ) { 2019684: 80 a2 20 00 cmp %o0, 0 2019688: 22 80 00 13 be,a 20196d4 <== NEVER TAKEN 201968c: b4 06 a0 01 inc %i2 <== NOT EXECUTED 2019690: da 02 20 10 ld [ %o0 + 0x10 ], %o5 2019694: 80 a3 60 00 cmp %o5, 0 2019698: 22 80 00 0f be,a 20196d4 <== NEVER TAKEN 201969c: b4 06 a0 01 inc %i2 <== NOT EXECUTED /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 20196a0: de 00 60 10 ld [ %g1 + 0x10 ], %o7 20196a4: 80 a3 e0 00 cmp %o7, 0 20196a8: 22 80 00 09 be,a 20196cc 20196ac: 84 10 00 03 mov %g3, %g2 continue; } DEBUG_STEP("6"); /* prefer blocked/interruptible over blocked/not interruptible */ if ( !_States_Is_interruptible_by_signal(interested->current_state) ) { 20196b0: 80 8b 40 18 btst %o5, %i0 20196b4: 32 80 00 08 bne,a 20196d4 20196b8: b4 06 a0 01 inc %i2 DEBUG_STEP("7"); if ( _States_Is_interruptible_by_signal(the_thread->current_state) ) { 20196bc: 80 8b c0 18 btst %o7, %i0 20196c0: 22 80 00 05 be,a 20196d4 20196c4: b4 06 a0 01 inc %i2 */ if ( interested && !_States_Is_ready( interested->current_state ) ) { /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 20196c8: 84 10 00 03 mov %g3, %g2 20196cc: 90 10 00 01 mov %g1, %o0 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 20196d0: b4 06 a0 01 inc %i2 20196d4: 80 a6 80 0a cmp %i2, %o2 20196d8: 08 bf ff db bleu 2019644 20196dc: 83 2e a0 02 sll %i2, 2, %g1 * + 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++) { 20196e0: 88 01 20 01 inc %g4 20196e4: 80 a1 20 04 cmp %g4, 4 20196e8: 12 bf ff cd bne 201961c 20196ec: 83 29 20 02 sll %g4, 2, %g1 } } } } if ( interested ) { 20196f0: 80 a2 20 00 cmp %o0, 0 20196f4: 02 80 00 0c be 2019724 20196f8: 01 00 00 00 nop /* * 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 ) ) { 20196fc: 92 10 00 19 mov %i1, %o1 2019700: 40 00 00 36 call 20197d8 <_POSIX_signals_Unblock_thread> 2019704: 94 07 bf f4 add %fp, -12, %o2 2019708: 80 8a 20 ff btst 0xff, %o0 201970c: 02 80 00 06 be 2019724 2019710: 01 00 00 00 nop _Thread_Enable_dispatch(); 2019714: 7f ff bd 7b call 2008d00 <_Thread_Enable_dispatch> 2019718: b0 10 20 00 clr %i0 ! 0 return 0; 201971c: 81 c7 e0 08 ret 2019720: 81 e8 00 00 restore /* * 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 ); 2019724: 40 00 00 24 call 20197b4 <_POSIX_signals_Set_process_signals> 2019728: 90 10 00 1d mov %i5, %o0 if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { 201972c: 83 2e 60 02 sll %i1, 2, %g1 2019730: b3 2e 60 04 sll %i1, 4, %i1 2019734: b2 26 40 01 sub %i1, %g1, %i1 2019738: 03 00 80 74 sethi %hi(0x201d000), %g1 201973c: 82 10 60 40 or %g1, 0x40, %g1 ! 201d040 <_POSIX_signals_Vectors> 2019740: c2 00 40 19 ld [ %g1 + %i1 ], %g1 2019744: 80 a0 60 02 cmp %g1, 2 2019748: 12 80 00 17 bne 20197a4 201974c: 11 00 80 74 sethi %hi(0x201d000), %o0 psiginfo = (POSIX_signals_Siginfo_node *) 2019750: 7f ff b6 03 call 2006f5c <_Chain_Get> 2019754: 90 12 21 c0 or %o0, 0x1c0, %o0 ! 201d1c0 <_POSIX_signals_Inactive_siginfo> _Chain_Get( &_POSIX_signals_Inactive_siginfo ); if ( !psiginfo ) { 2019758: ba 92 20 00 orcc %o0, 0, %i5 201975c: 12 80 00 0a bne 2019784 2019760: 92 07 bf f4 add %fp, -12, %o1 _Thread_Enable_dispatch(); 2019764: 7f ff bd 67 call 2008d00 <_Thread_Enable_dispatch> 2019768: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EAGAIN ); 201976c: 7f ff d4 e2 call 200eaf4 <__errno> 2019770: 01 00 00 00 nop 2019774: 82 10 20 0b mov 0xb, %g1 ! b 2019778: c2 22 00 00 st %g1, [ %o0 ] 201977c: 81 c7 e0 08 ret 2019780: 91 e8 3f ff restore %g0, -1, %o0 } psiginfo->Info = *siginfo; 2019784: 90 07 60 08 add %i5, 8, %o0 2019788: 7f ff d7 37 call 200f464 201978c: 94 10 20 0c mov 0xc, %o2 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 2019790: 11 00 80 74 sethi %hi(0x201d000), %o0 2019794: 92 10 00 1d mov %i5, %o1 2019798: 90 12 22 38 or %o0, 0x238, %o0 201979c: 7f ff b5 dc call 2006f0c <_Chain_Append> 20197a0: 90 02 00 19 add %o0, %i1, %o0 } DEBUG_STEP("\n"); _Thread_Enable_dispatch(); 20197a4: 7f ff bd 57 call 2008d00 <_Thread_Enable_dispatch> 20197a8: b0 10 20 00 clr %i0 return 0; } 20197ac: 81 c7 e0 08 ret 20197b0: 81 e8 00 00 restore =============================================================================== 0200b664 : int pthread_attr_setschedpolicy( pthread_attr_t *attr, int policy ) { 200b664: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 200b668: 80 a0 60 00 cmp %g1, 0 200b66c: 02 80 00 0f be 200b6a8 200b670: 90 10 20 16 mov 0x16, %o0 200b674: c4 00 40 00 ld [ %g1 ], %g2 200b678: 80 a0 a0 00 cmp %g2, 0 200b67c: 02 80 00 0b be 200b6a8 200b680: 80 a2 60 04 cmp %o1, 4 return EINVAL; switch ( policy ) { 200b684: 18 80 00 09 bgu 200b6a8 200b688: 90 10 20 86 mov 0x86, %o0 200b68c: 84 10 20 01 mov 1, %g2 200b690: 85 28 80 09 sll %g2, %o1, %g2 200b694: 80 88 a0 17 btst 0x17, %g2 200b698: 02 80 00 04 be 200b6a8 <== NEVER TAKEN 200b69c: 01 00 00 00 nop case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: case SCHED_SPORADIC: attr->schedpolicy = policy; 200b6a0: d2 20 60 14 st %o1, [ %g1 + 0x14 ] 200b6a4: 90 10 20 00 clr %o0 return 0; default: return ENOTSUP; } } 200b6a8: 81 c3 e0 08 retl =============================================================================== 0200641c : int pthread_barrier_init( pthread_barrier_t *barrier, const pthread_barrierattr_t *attr, unsigned int count ) { 200641c: 9d e3 bf 90 save %sp, -112, %sp 2006420: ba 10 00 18 mov %i0, %i5 const pthread_barrierattr_t *the_attr; /* * Error check parameters */ if ( !barrier ) 2006424: 80 a7 60 00 cmp %i5, 0 2006428: 02 80 00 20 be 20064a8 200642c: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( count == 0 ) 2006430: 80 a6 a0 00 cmp %i2, 0 2006434: 02 80 00 1d be 20064a8 2006438: 80 a6 60 00 cmp %i1, 0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 200643c: 32 80 00 06 bne,a 2006454 2006440: c2 06 40 00 ld [ %i1 ], %g1 the_attr = attr; } else { (void) pthread_barrierattr_init( &my_attr ); 2006444: 90 07 bf f8 add %fp, -8, %o0 2006448: 7f ff ff bd call 200633c 200644c: 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 ) 2006450: c2 06 40 00 ld [ %i1 ], %g1 2006454: 80 a0 60 00 cmp %g1, 0 2006458: 02 80 00 14 be 20064a8 200645c: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 2006460: c2 06 60 04 ld [ %i1 + 4 ], %g1 2006464: 80 a0 60 00 cmp %g1, 0 2006468: 12 80 00 10 bne 20064a8 <== NEVER TAKEN 200646c: 03 00 80 5d sethi %hi(0x2017400), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2006470: c4 00 61 90 ld [ %g1 + 0x190 ], %g2 ! 2017590 <_Thread_Dispatch_disable_level> } /* * Convert from POSIX attributes to Core Barrier attributes */ the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE; 2006474: c0 27 bf f0 clr [ %fp + -16 ] the_attributes.maximum_count = count; 2006478: f4 27 bf f4 st %i2, [ %fp + -12 ] 200647c: 84 00 a0 01 inc %g2 2006480: c4 20 61 90 st %g2, [ %g1 + 0x190 ] return _Thread_Dispatch_disable_level; 2006484: c2 00 61 90 ld [ %g1 + 0x190 ], %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 *) 2006488: 37 00 80 5e sethi %hi(0x2017800), %i3 200648c: 40 00 08 5d call 2008600 <_Objects_Allocate> 2006490: 90 16 e1 50 or %i3, 0x150, %o0 ! 2017950 <_POSIX_Barrier_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _POSIX_Barrier_Allocate(); if ( !the_barrier ) { 2006494: b8 92 20 00 orcc %o0, 0, %i4 2006498: 12 80 00 06 bne 20064b0 200649c: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); 20064a0: 40 00 0d 24 call 2009930 <_Thread_Enable_dispatch> 20064a4: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 20064a8: 81 c7 e0 08 ret 20064ac: 81 e8 00 00 restore } _CORE_barrier_Initialize( &the_barrier->Barrier, &the_attributes ); 20064b0: 40 00 05 c4 call 2007bc0 <_CORE_barrier_Initialize> 20064b4: 92 07 bf f0 add %fp, -16, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20064b8: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 * Exit the critical section and return the user an operational barrier */ *barrier = the_barrier->Object.id; _Thread_Enable_dispatch(); return 0; } 20064bc: b6 16 e1 50 or %i3, 0x150, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20064c0: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 20064c4: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20064c8: 85 28 a0 02 sll %g2, 2, %g2 20064cc: 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; 20064d0: c0 27 20 0c clr [ %i4 + 0xc ] ); /* * Exit the critical section and return the user an operational barrier */ *barrier = the_barrier->Object.id; 20064d4: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 20064d8: 40 00 0d 16 call 2009930 <_Thread_Enable_dispatch> 20064dc: b0 10 20 00 clr %i0 return 0; } 20064e0: 81 c7 e0 08 ret 20064e4: 81 e8 00 00 restore =============================================================================== 02005ca4 : void pthread_cleanup_push( void (*routine)( void * ), void *arg ) { 2005ca4: 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 ) 2005ca8: 80 a6 20 00 cmp %i0, 0 2005cac: 02 80 00 15 be 2005d00 2005cb0: 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++; 2005cb4: 03 00 80 5e sethi %hi(0x2017800), %g1 2005cb8: c4 00 62 b0 ld [ %g1 + 0x2b0 ], %g2 ! 2017ab0 <_Thread_Dispatch_disable_level> 2005cbc: 84 00 a0 01 inc %g2 2005cc0: c4 20 62 b0 st %g2, [ %g1 + 0x2b0 ] return _Thread_Dispatch_disable_level; 2005cc4: c2 00 62 b0 ld [ %g1 + 0x2b0 ], %g1 return; _Thread_Disable_dispatch(); handler = _Workspace_Allocate( sizeof( POSIX_Cancel_Handler_control ) ); 2005cc8: 40 00 11 d4 call 200a418 <_Workspace_Allocate> 2005ccc: 90 10 20 10 mov 0x10, %o0 if ( handler ) { 2005cd0: 92 92 20 00 orcc %o0, 0, %o1 2005cd4: 02 80 00 09 be 2005cf8 <== NEVER TAKEN 2005cd8: 01 00 00 00 nop thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 2005cdc: 03 00 80 5f sethi %hi(0x2017c00), %g1 2005ce0: c2 00 63 f4 ld [ %g1 + 0x3f4 ], %g1 ! 2017ff4 <_Per_CPU_Information+0xc> handler_stack = &thread_support->Cancellation_Handlers; 2005ce4: d0 00 61 5c ld [ %g1 + 0x15c ], %o0 handler->routine = routine; 2005ce8: f0 22 60 08 st %i0, [ %o1 + 8 ] handler->arg = arg; 2005cec: f2 22 60 0c st %i1, [ %o1 + 0xc ] _Chain_Append( handler_stack, &handler->Node ); 2005cf0: 40 00 06 12 call 2007538 <_Chain_Append> 2005cf4: 90 02 20 e4 add %o0, 0xe4, %o0 } _Thread_Enable_dispatch(); 2005cf8: 40 00 0d 62 call 2009280 <_Thread_Enable_dispatch> 2005cfc: 81 e8 00 00 restore 2005d00: 81 c7 e0 08 ret 2005d04: 81 e8 00 00 restore =============================================================================== 02006c6c : int pthread_cond_init( pthread_cond_t *cond, const pthread_condattr_t *attr ) { 2006c6c: 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; 2006c70: 80 a6 60 00 cmp %i1, 0 2006c74: 12 80 00 04 bne 2006c84 2006c78: ba 10 00 18 mov %i0, %i5 else the_attr = &_POSIX_Condition_variables_Default_attributes; 2006c7c: 33 00 80 5b sethi %hi(0x2016c00), %i1 2006c80: b2 16 62 84 or %i1, 0x284, %i1 ! 2016e84 <_POSIX_Condition_variables_Default_attributes> /* * Be careful about attributes when global!!! */ if ( the_attr->process_shared == PTHREAD_PROCESS_SHARED ) 2006c84: c2 06 60 04 ld [ %i1 + 4 ], %g1 2006c88: 80 a0 60 01 cmp %g1, 1 2006c8c: 02 80 00 12 be 2006cd4 <== NEVER TAKEN 2006c90: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !the_attr->is_initialized ) 2006c94: c2 06 40 00 ld [ %i1 ], %g1 2006c98: 80 a0 60 00 cmp %g1, 0 2006c9c: 02 80 00 0e be 2006cd4 2006ca0: 03 00 80 61 sethi %hi(0x2018400), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2006ca4: c4 00 62 c0 ld [ %g1 + 0x2c0 ], %g2 ! 20186c0 <_Thread_Dispatch_disable_level> 2006ca8: 84 00 a0 01 inc %g2 2006cac: c4 20 62 c0 st %g2, [ %g1 + 0x2c0 ] return _Thread_Dispatch_disable_level; 2006cb0: c2 00 62 c0 ld [ %g1 + 0x2c0 ], %g1 */ RTEMS_INLINE_ROUTINE POSIX_Condition_variables_Control *_POSIX_Condition_variables_Allocate( void ) { return (POSIX_Condition_variables_Control *) 2006cb4: 37 00 80 62 sethi %hi(0x2018800), %i3 2006cb8: 40 00 09 df call 2009434 <_Objects_Allocate> 2006cbc: 90 16 e3 18 or %i3, 0x318, %o0 ! 2018b18 <_POSIX_Condition_variables_Information> _Thread_Disable_dispatch(); the_cond = _POSIX_Condition_variables_Allocate(); if ( !the_cond ) { 2006cc0: b8 92 20 00 orcc %o0, 0, %i4 2006cc4: 32 80 00 06 bne,a 2006cdc 2006cc8: c2 06 60 04 ld [ %i1 + 4 ], %g1 _Thread_Enable_dispatch(); 2006ccc: 40 00 0e a6 call 200a764 <_Thread_Enable_dispatch> 2006cd0: b0 10 20 0c mov 0xc, %i0 return ENOMEM; 2006cd4: 81 c7 e0 08 ret 2006cd8: 81 e8 00 00 restore the_cond->process_shared = the_attr->process_shared; the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 2006cdc: 90 07 20 18 add %i4, 0x18, %o0 if ( !the_cond ) { _Thread_Enable_dispatch(); return ENOMEM; } the_cond->process_shared = the_attr->process_shared; 2006ce0: c2 27 20 10 st %g1, [ %i4 + 0x10 ] the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 2006ce4: 92 10 20 00 clr %o1 2006ce8: 15 04 00 02 sethi %hi(0x10000800), %o2 2006cec: 96 10 20 74 mov 0x74, %o3 2006cf0: 40 00 10 9a call 200af58 <_Thread_queue_Initialize> 2006cf4: c0 27 20 14 clr [ %i4 + 0x14 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006cf8: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 *cond = the_cond->Object.id; _Thread_Enable_dispatch(); return 0; } 2006cfc: b6 16 e3 18 or %i3, 0x318, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006d00: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006d04: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006d08: 85 28 a0 02 sll %g2, 2, %g2 2006d0c: 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; 2006d10: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_Condition_variables_Information, &the_cond->Object, 0 ); *cond = the_cond->Object.id; 2006d14: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2006d18: 40 00 0e 93 call 200a764 <_Thread_Enable_dispatch> 2006d1c: b0 10 20 00 clr %i0 return 0; } 2006d20: 81 c7 e0 08 ret 2006d24: 81 e8 00 00 restore =============================================================================== 02006ad8 : */ int pthread_condattr_destroy( pthread_condattr_t *attr ) { 2006ad8: 82 10 00 08 mov %o0, %g1 if ( !attr || attr->is_initialized == false ) 2006adc: 80 a0 60 00 cmp %g1, 0 2006ae0: 02 80 00 08 be 2006b00 2006ae4: 90 10 20 16 mov 0x16, %o0 2006ae8: c4 00 40 00 ld [ %g1 ], %g2 2006aec: 80 a0 a0 00 cmp %g2, 0 2006af0: 02 80 00 04 be 2006b00 <== NEVER TAKEN 2006af4: 01 00 00 00 nop return EINVAL; attr->is_initialized = false; 2006af8: c0 20 40 00 clr [ %g1 ] return 0; 2006afc: 90 10 20 00 clr %o0 } 2006b00: 81 c3 e0 08 retl =============================================================================== 020060f0 : pthread_t *thread, const pthread_attr_t *attr, void *(*start_routine)( void * ), void *arg ) { 20060f0: 9d e3 bf 58 save %sp, -168, %sp 20060f4: ba 10 00 18 mov %i0, %i5 int schedpolicy = SCHED_RR; struct sched_param schedparam; Objects_Name name; int rc; if ( !start_routine ) 20060f8: 80 a6 a0 00 cmp %i2, 0 20060fc: 02 80 00 66 be 2006294 2006100: b0 10 20 0e mov 0xe, %i0 return EFAULT; the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes; 2006104: 80 a6 60 00 cmp %i1, 0 2006108: 32 80 00 05 bne,a 200611c 200610c: c2 06 40 00 ld [ %i1 ], %g1 2006110: 33 00 80 6e sethi %hi(0x201b800), %i1 2006114: b2 16 62 2c or %i1, 0x22c, %i1 ! 201ba2c <_POSIX_Threads_Default_attributes> if ( !the_attr->is_initialized ) 2006118: c2 06 40 00 ld [ %i1 ], %g1 200611c: 80 a0 60 00 cmp %g1, 0 2006120: 02 80 00 5d be 2006294 2006124: 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) ) 2006128: c2 06 60 04 ld [ %i1 + 4 ], %g1 200612c: 80 a0 60 00 cmp %g1, 0 2006130: 02 80 00 07 be 200614c 2006134: 03 00 80 71 sethi %hi(0x201c400), %g1 2006138: c4 06 60 08 ld [ %i1 + 8 ], %g2 200613c: c2 00 63 60 ld [ %g1 + 0x360 ], %g1 2006140: 80 a0 80 01 cmp %g2, %g1 2006144: 0a 80 00 79 bcs 2006328 2006148: 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 ) { 200614c: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 2006150: 80 a0 60 01 cmp %g1, 1 2006154: 02 80 00 06 be 200616c 2006158: 80 a0 60 02 cmp %g1, 2 200615c: 12 80 00 4e bne 2006294 2006160: b0 10 20 16 mov 0x16, %i0 schedpolicy = api->schedpolicy; schedparam = api->schedparam; break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; 2006164: 10 80 00 09 b 2006188 2006168: e0 06 60 14 ld [ %i1 + 0x14 ], %l0 * 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 ]; 200616c: 03 00 80 76 sethi %hi(0x201d800), %g1 2006170: c2 00 61 84 ld [ %g1 + 0x184 ], %g1 ! 201d984 <_Per_CPU_Information+0xc> schedpolicy = api->schedpolicy; schedparam = api->schedparam; 2006174: 90 07 bf dc add %fp, -36, %o0 * 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 ]; 2006178: d2 00 61 5c ld [ %g1 + 0x15c ], %o1 schedpolicy = api->schedpolicy; 200617c: e0 02 60 84 ld [ %o1 + 0x84 ], %l0 schedparam = api->schedparam; 2006180: 10 80 00 04 b 2006190 2006184: 92 02 60 88 add %o1, 0x88, %o1 break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; schedparam = the_attr->schedparam; 2006188: 90 07 bf dc add %fp, -36, %o0 200618c: 92 06 60 18 add %i1, 0x18, %o1 2006190: 40 00 26 97 call 200fbec 2006194: 94 10 20 1c mov 0x1c, %o2 /* * Check the contentionscope since rtems only supports PROCESS wide * contention (i.e. no system wide contention). */ if ( the_attr->contentionscope != PTHREAD_SCOPE_PROCESS ) 2006198: c2 06 60 0c ld [ %i1 + 0xc ], %g1 200619c: 80 a0 60 00 cmp %g1, 0 20061a0: 12 80 00 3d bne 2006294 20061a4: b0 10 20 86 mov 0x86, %i0 return ENOTSUP; /* * Interpret the scheduling parameters. */ if ( !_POSIX_Priority_Is_valid( schedparam.sched_priority ) ) 20061a8: d0 07 bf dc ld [ %fp + -36 ], %o0 20061ac: 40 00 1a 2e call 200ca64 <_POSIX_Priority_Is_valid> 20061b0: b0 10 20 16 mov 0x16, %i0 20061b4: 80 8a 20 ff btst 0xff, %o0 20061b8: 02 80 00 37 be 2006294 <== NEVER TAKEN 20061bc: 03 00 80 71 sethi %hi(0x201c400), %g1 return EINVAL; core_priority = _POSIX_Priority_To_core( schedparam.sched_priority ); 20061c0: 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); 20061c4: e2 08 63 5c ldub [ %g1 + 0x35c ], %l1 /* * Set the core scheduling policy information. */ rc = _POSIX_Thread_Translate_sched_param( 20061c8: 90 10 00 10 mov %l0, %o0 20061cc: 92 07 bf dc add %fp, -36, %o1 20061d0: 94 07 bf f8 add %fp, -8, %o2 20061d4: 40 00 1a 2f call 200ca90 <_POSIX_Thread_Translate_sched_param> 20061d8: 96 07 bf fc add %fp, -4, %o3 schedpolicy, &schedparam, &budget_algorithm, &budget_callout ); if ( rc ) 20061dc: b0 92 20 00 orcc %o0, 0, %i0 20061e0: 12 80 00 2d bne 2006294 20061e4: 27 00 80 75 sethi %hi(0x201d400), %l3 #endif /* * Lock the allocator mutex for protection */ _RTEMS_Lock_allocator(); 20061e8: 40 00 06 25 call 2007a7c <_API_Mutex_Lock> 20061ec: d0 04 e0 e4 ld [ %l3 + 0xe4 ], %o0 ! 201d4e4 <_RTEMS_Allocator_Mutex> * _POSIX_Threads_Allocate */ RTEMS_INLINE_ROUTINE Thread_Control *_POSIX_Threads_Allocate( void ) { return (Thread_Control *) _Objects_Allocate( &_POSIX_Threads_Information ); 20061f0: 11 00 80 75 sethi %hi(0x201d400), %o0 20061f4: 40 00 08 c9 call 2008518 <_Objects_Allocate> 20061f8: 90 12 22 80 or %o0, 0x280, %o0 ! 201d680 <_POSIX_Threads_Information> * Allocate the thread control block. * * NOTE: Global threads are not currently supported. */ the_thread = _POSIX_Threads_Allocate(); if ( !the_thread ) { 20061fc: b8 92 20 00 orcc %o0, 0, %i4 2006200: 32 80 00 04 bne,a 2006210 2006204: c2 06 60 08 ld [ %i1 + 8 ], %g1 _RTEMS_Unlock_allocator(); 2006208: 10 80 00 21 b 200628c 200620c: d0 04 e0 e4 ld [ %l3 + 0xe4 ], %o0 static inline size_t _POSIX_Threads_Ensure_minimum_stack ( size_t size ) { if ( size >= PTHREAD_MINIMUM_STACK_SIZE ) 2006210: 05 00 80 71 sethi %hi(0x201c400), %g2 2006214: d6 00 a3 60 ld [ %g2 + 0x360 ], %o3 ! 201c760 /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 2006218: 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 ) 200621c: 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( 2006220: 80 a2 c0 01 cmp %o3, %g1 2006224: 1a 80 00 03 bcc 2006230 2006228: d4 06 60 04 ld [ %i1 + 4 ], %o2 200622c: 96 10 00 01 mov %g1, %o3 2006230: 82 10 20 01 mov 1, %g1 2006234: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2006238: c2 07 bf f8 ld [ %fp + -8 ], %g1 200623c: 9a 0c 60 ff and %l1, 0xff, %o5 2006240: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 2006244: c2 07 bf fc ld [ %fp + -4 ], %g1 2006248: c0 23 a0 68 clr [ %sp + 0x68 ] 200624c: c2 23 a0 64 st %g1, [ %sp + 0x64 ] 2006250: 82 07 bf d4 add %fp, -44, %g1 2006254: 23 00 80 75 sethi %hi(0x201d400), %l1 2006258: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 200625c: 90 14 62 80 or %l1, 0x280, %o0 2006260: 92 10 00 1c mov %i4, %o1 2006264: 98 10 20 01 mov 1, %o4 2006268: 40 00 0d b1 call 200992c <_Thread_Initialize> 200626c: 9a 23 40 12 sub %o5, %l2, %o5 budget_callout, 0, /* isr level */ name /* posix threads don't have a name */ ); if ( !status ) { 2006270: 80 8a 20 ff btst 0xff, %o0 2006274: 12 80 00 0a bne 200629c 2006278: 90 14 62 80 or %l1, 0x280, %o0 RTEMS_INLINE_ROUTINE void _POSIX_Threads_Free ( Thread_Control *the_pthread ) { _Objects_Free( &_POSIX_Threads_Information, &the_pthread->Object ); 200627c: 40 00 09 80 call 200887c <_Objects_Free> 2006280: 92 10 00 1c mov %i4, %o1 _POSIX_Threads_Free( the_thread ); _RTEMS_Unlock_allocator(); 2006284: 03 00 80 75 sethi %hi(0x201d400), %g1 2006288: d0 00 60 e4 ld [ %g1 + 0xe4 ], %o0 ! 201d4e4 <_RTEMS_Allocator_Mutex> 200628c: 40 00 06 11 call 2007ad0 <_API_Mutex_Unlock> 2006290: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2006294: 81 c7 e0 08 ret 2006298: 81 e8 00 00 restore } /* * finish initializing the per API structure */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200629c: e2 07 21 5c ld [ %i4 + 0x15c ], %l1 api->Attributes = *the_attr; 20062a0: 92 10 00 19 mov %i1, %o1 20062a4: 94 10 20 40 mov 0x40, %o2 20062a8: 40 00 26 51 call 200fbec 20062ac: 90 10 00 11 mov %l1, %o0 api->detachstate = the_attr->detachstate; 20062b0: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 api->schedpolicy = schedpolicy; api->schedparam = schedparam; 20062b4: 92 07 bf dc add %fp, -36, %o1 * finish initializing the per API structure */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; api->Attributes = *the_attr; api->detachstate = the_attr->detachstate; 20062b8: c2 24 60 40 st %g1, [ %l1 + 0x40 ] api->schedpolicy = schedpolicy; api->schedparam = schedparam; 20062bc: 94 10 20 1c mov 0x1c, %o2 */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; api->Attributes = *the_attr; api->detachstate = the_attr->detachstate; api->schedpolicy = schedpolicy; 20062c0: e0 24 60 84 st %l0, [ %l1 + 0x84 ] api->schedparam = schedparam; 20062c4: 40 00 26 4a call 200fbec 20062c8: 90 04 60 88 add %l1, 0x88, %o0 /* * POSIX threads are allocated and started in one operation. */ status = _Thread_Start( 20062cc: 90 10 00 1c mov %i4, %o0 20062d0: 92 10 20 01 mov 1, %o1 20062d4: 94 10 00 1a mov %i2, %o2 20062d8: 96 10 00 1b mov %i3, %o3 20062dc: 40 00 0f e8 call 200a27c <_Thread_Start> 20062e0: 98 10 20 00 clr %o4 _RTEMS_Unlock_allocator(); return EINVAL; } #endif if ( schedpolicy == SCHED_SPORADIC ) { 20062e4: 80 a4 20 04 cmp %l0, 4 20062e8: 32 80 00 0a bne,a 2006310 20062ec: c2 07 20 08 ld [ %i4 + 8 ], %g1 _Watchdog_Insert_ticks( 20062f0: 40 00 10 35 call 200a3c4 <_Timespec_To_ticks> 20062f4: 90 04 60 90 add %l1, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20062f8: 92 04 60 a8 add %l1, 0xa8, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20062fc: d0 24 60 b4 st %o0, [ %l1 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2006300: 11 00 80 75 sethi %hi(0x201d400), %o0 2006304: 40 00 11 08 call 200a724 <_Watchdog_Insert> 2006308: 90 12 20 fc or %o0, 0xfc, %o0 ! 201d4fc <_Watchdog_Ticks_chain> } /* * Return the id and indicate we successfully created the thread */ *thread = the_thread->Object.id; 200630c: c2 07 20 08 ld [ %i4 + 8 ], %g1 2006310: c2 27 40 00 st %g1, [ %i5 ] _RTEMS_Unlock_allocator(); 2006314: 03 00 80 75 sethi %hi(0x201d400), %g1 2006318: 40 00 05 ee call 2007ad0 <_API_Mutex_Unlock> 200631c: d0 00 60 e4 ld [ %g1 + 0xe4 ], %o0 ! 201d4e4 <_RTEMS_Allocator_Mutex> return 0; 2006320: 81 c7 e0 08 ret 2006324: 81 e8 00 00 restore } 2006328: 81 c7 e0 08 ret 200632c: 81 e8 00 00 restore =============================================================================== 02019924 : int pthread_kill( pthread_t thread, int sig ) { 2019924: 9d e3 bf 98 save %sp, -104, %sp POSIX_API_Control *api; Thread_Control *the_thread; Objects_Locations location; if ( !sig ) 2019928: 80 a6 60 00 cmp %i1, 0 201992c: 02 80 00 06 be 2019944 2019930: 90 10 00 18 mov %i0, %o0 static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 2019934: b6 06 7f ff add %i1, -1, %i3 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 2019938: 80 a6 e0 1f cmp %i3, 0x1f 201993c: 08 80 00 08 bleu 201995c 2019940: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); 2019944: 7f ff d4 6c call 200eaf4 <__errno> 2019948: b0 10 3f ff mov -1, %i0 ! ffffffff 201994c: 82 10 20 16 mov 0x16, %g1 2019950: c2 22 00 00 st %g1, [ %o0 ] 2019954: 81 c7 e0 08 ret 2019958: 81 e8 00 00 restore the_thread = _Thread_Get( thread, &location ); 201995c: 7f ff bc f6 call 2008d34 <_Thread_Get> 2019960: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2019964: c2 07 bf fc ld [ %fp + -4 ], %g1 2019968: 80 a0 60 00 cmp %g1, 0 201996c: 12 80 00 22 bne 20199f4 <== NEVER TAKEN 2019970: b8 10 00 08 mov %o0, %i4 api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( sig ) { if ( _POSIX_signals_Vectors[ sig ].sa_handler == SIG_IGN ) { 2019974: 85 2e 60 02 sll %i1, 2, %g2 2019978: 87 2e 60 04 sll %i1, 4, %g3 201997c: 86 20 c0 02 sub %g3, %g2, %g3 2019980: 05 00 80 74 sethi %hi(0x201d000), %g2 2019984: 84 10 a0 40 or %g2, 0x40, %g2 ! 201d040 <_POSIX_signals_Vectors> 2019988: 84 00 80 03 add %g2, %g3, %g2 201998c: c4 00 a0 08 ld [ %g2 + 8 ], %g2 2019990: 80 a0 a0 01 cmp %g2, 1 2019994: 02 80 00 14 be 20199e4 2019998: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 201999c: c4 00 60 d4 ld [ %g1 + 0xd4 ], %g2 static inline sigset_t signo_to_mask( uint32_t sig ) { return 1u << (sig - 1); 20199a0: ba 10 20 01 mov 1, %i5 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 20199a4: 92 10 00 19 mov %i1, %o1 20199a8: b7 2f 40 1b sll %i5, %i3, %i3 20199ac: 94 10 20 00 clr %o2 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 20199b0: b6 10 80 1b or %g2, %i3, %i3 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 20199b4: 7f ff ff 89 call 20197d8 <_POSIX_signals_Unblock_thread> 20199b8: f6 20 60 d4 st %i3, [ %g1 + 0xd4 ] if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 20199bc: 03 00 80 73 sethi %hi(0x201cc00), %g1 20199c0: 82 10 63 e8 or %g1, 0x3e8, %g1 ! 201cfe8 <_Per_CPU_Information> 20199c4: c4 00 60 08 ld [ %g1 + 8 ], %g2 20199c8: 80 a0 a0 00 cmp %g2, 0 20199cc: 02 80 00 06 be 20199e4 20199d0: 01 00 00 00 nop 20199d4: c4 00 60 0c ld [ %g1 + 0xc ], %g2 20199d8: 80 a7 00 02 cmp %i4, %g2 20199dc: 22 80 00 02 be,a 20199e4 20199e0: fa 28 60 18 stb %i5, [ %g1 + 0x18 ] _Thread_Dispatch_necessary = true; } _Thread_Enable_dispatch(); 20199e4: 7f ff bc c7 call 2008d00 <_Thread_Enable_dispatch> 20199e8: b0 10 20 00 clr %i0 return 0; 20199ec: 81 c7 e0 08 ret 20199f0: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( ESRCH ); 20199f4: 7f ff d4 40 call 200eaf4 <__errno> <== NOT EXECUTED 20199f8: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20199fc: 82 10 20 03 mov 3, %g1 <== NOT EXECUTED 2019a00: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED } 2019a04: 81 c7 e0 08 ret <== NOT EXECUTED 2019a08: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 020081dc : int pthread_mutex_timedlock( pthread_mutex_t *mutex, const struct timespec *abstime ) { 20081dc: 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 ); 20081e0: 92 07 bf fc add %fp, -4, %o1 20081e4: 40 00 00 37 call 20082c0 <_POSIX_Absolute_timeout_to_ticks> 20081e8: 90 10 00 19 mov %i1, %o0 if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks ); 20081ec: d4 07 bf fc ld [ %fp + -4 ], %o2 int _EXFUN(pthread_mutex_trylock, (pthread_mutex_t *__mutex)); int _EXFUN(pthread_mutex_unlock, (pthread_mutex_t *__mutex)); #if defined(_POSIX_TIMEOUTS) int _EXFUN(pthread_mutex_timedlock, 20081f0: 82 1a 20 03 xor %o0, 3, %g1 20081f4: 80 a0 00 01 cmp %g0, %g1 * * 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 ); 20081f8: ba 10 00 08 mov %o0, %i5 if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; lock_status = _POSIX_Mutex_Lock_support( mutex, do_wait, ticks ); 20081fc: b8 60 3f ff subx %g0, -1, %i4 2008200: 90 10 00 18 mov %i0, %o0 2008204: 7f ff ff bd call 20080f8 <_POSIX_Mutex_Lock_support> 2008208: 92 10 00 1c mov %i4, %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) ) { 200820c: 80 a7 20 00 cmp %i4, 0 2008210: 12 80 00 0d bne 2008244 2008214: b0 10 00 08 mov %o0, %i0 2008218: 80 a2 20 10 cmp %o0, 0x10 200821c: 12 80 00 0a bne 2008244 2008220: 80 a7 60 00 cmp %i5, 0 if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 2008224: 02 80 00 07 be 2008240 <== NEVER TAKEN 2008228: ba 07 7f ff add %i5, -1, %i5 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 200822c: 80 a7 60 01 cmp %i5, 1 2008230: 18 80 00 05 bgu 2008244 <== NEVER TAKEN 2008234: 01 00 00 00 nop status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; 2008238: 81 c7 e0 08 ret 200823c: 91 e8 20 74 restore %g0, 0x74, %o0 2008240: b0 10 20 16 mov 0x16, %i0 <== NOT EXECUTED } return lock_status; } 2008244: 81 c7 e0 08 ret 2008248: 81 e8 00 00 restore =============================================================================== 020059b8 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_gettype( const pthread_mutexattr_t *attr, int *type ) { 20059b8: 82 10 00 08 mov %o0, %g1 if ( !attr ) 20059bc: 80 a0 60 00 cmp %g1, 0 20059c0: 02 80 00 0b be 20059ec 20059c4: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 20059c8: c4 00 40 00 ld [ %g1 ], %g2 20059cc: 80 a0 a0 00 cmp %g2, 0 20059d0: 02 80 00 07 be 20059ec 20059d4: 80 a2 60 00 cmp %o1, 0 return EINVAL; if ( !type ) 20059d8: 02 80 00 05 be 20059ec <== NEVER TAKEN 20059dc: 01 00 00 00 nop return EINVAL; *type = attr->type; 20059e0: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 return 0; 20059e4: 90 10 20 00 clr %o0 return EINVAL; if ( !type ) return EINVAL; *type = attr->type; 20059e8: c2 22 40 00 st %g1, [ %o1 ] return 0; } 20059ec: 81 c3 e0 08 retl =============================================================================== 02007dcc : int pthread_mutexattr_setpshared( pthread_mutexattr_t *attr, int pshared ) { 2007dcc: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 2007dd0: 80 a0 60 00 cmp %g1, 0 2007dd4: 02 80 00 0a be 2007dfc 2007dd8: 90 10 20 16 mov 0x16, %o0 2007ddc: c4 00 40 00 ld [ %g1 ], %g2 2007de0: 80 a0 a0 00 cmp %g2, 0 2007de4: 02 80 00 06 be 2007dfc 2007de8: 80 a2 60 01 cmp %o1, 1 return EINVAL; switch ( pshared ) { 2007dec: 18 80 00 04 bgu 2007dfc <== NEVER TAKEN 2007df0: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 2007df4: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; 2007df8: 90 10 20 00 clr %o0 default: return EINVAL; } } 2007dfc: 81 c3 e0 08 retl =============================================================================== 02005a24 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_settype( pthread_mutexattr_t *attr, int type ) { 2005a24: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 2005a28: 80 a0 60 00 cmp %g1, 0 2005a2c: 02 80 00 0a be 2005a54 2005a30: 90 10 20 16 mov 0x16, %o0 2005a34: c4 00 40 00 ld [ %g1 ], %g2 2005a38: 80 a0 a0 00 cmp %g2, 0 2005a3c: 02 80 00 06 be 2005a54 <== NEVER TAKEN 2005a40: 80 a2 60 03 cmp %o1, 3 return EINVAL; switch ( type ) { 2005a44: 18 80 00 04 bgu 2005a54 2005a48: 01 00 00 00 nop case PTHREAD_MUTEX_NORMAL: case PTHREAD_MUTEX_RECURSIVE: case PTHREAD_MUTEX_ERRORCHECK: case PTHREAD_MUTEX_DEFAULT: attr->type = type; 2005a4c: d2 20 60 10 st %o1, [ %g1 + 0x10 ] return 0; 2005a50: 90 10 20 00 clr %o0 default: return EINVAL; } } 2005a54: 81 c3 e0 08 retl =============================================================================== 02006788 : int pthread_once( pthread_once_t *once_control, void (*init_routine)(void) ) { 2006788: 9d e3 bf 98 save %sp, -104, %sp if ( !once_control || !init_routine ) 200678c: 80 a6 60 00 cmp %i1, 0 2006790: 02 80 00 1c be 2006800 2006794: ba 10 00 18 mov %i0, %i5 2006798: 80 a6 20 00 cmp %i0, 0 200679c: 22 80 00 17 be,a 20067f8 20067a0: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !once_control->init_executed ) { 20067a4: c2 06 20 04 ld [ %i0 + 4 ], %g1 20067a8: 80 a0 60 00 cmp %g1, 0 20067ac: 12 80 00 13 bne 20067f8 20067b0: b0 10 20 00 clr %i0 rtems_mode saveMode; rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode); 20067b4: 90 10 21 00 mov 0x100, %o0 20067b8: 92 10 21 00 mov 0x100, %o1 20067bc: 40 00 03 06 call 20073d4 20067c0: 94 07 bf fc add %fp, -4, %o2 if ( !once_control->init_executed ) { 20067c4: c2 07 60 04 ld [ %i5 + 4 ], %g1 20067c8: 80 a0 60 00 cmp %g1, 0 20067cc: 12 80 00 07 bne 20067e8 <== NEVER TAKEN 20067d0: d0 07 bf fc ld [ %fp + -4 ], %o0 once_control->is_initialized = true; 20067d4: 82 10 20 01 mov 1, %g1 20067d8: c2 27 40 00 st %g1, [ %i5 ] once_control->init_executed = true; (*init_routine)(); 20067dc: 9f c6 40 00 call %i1 20067e0: c2 27 60 04 st %g1, [ %i5 + 4 ] } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); 20067e4: d0 07 bf fc ld [ %fp + -4 ], %o0 20067e8: 92 10 21 00 mov 0x100, %o1 20067ec: 94 07 bf fc add %fp, -4, %o2 20067f0: 40 00 02 f9 call 20073d4 20067f4: b0 10 20 00 clr %i0 20067f8: 81 c7 e0 08 ret 20067fc: 81 e8 00 00 restore pthread_once_t *once_control, void (*init_routine)(void) ) { if ( !once_control || !init_routine ) return EINVAL; 2006800: b0 10 20 16 mov 0x16, %i0 (*init_routine)(); } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); } return 0; } 2006804: 81 c7 e0 08 ret 2006808: 81 e8 00 00 restore =============================================================================== 020070e8 : int pthread_rwlock_init( pthread_rwlock_t *rwlock, const pthread_rwlockattr_t *attr ) { 20070e8: 9d e3 bf 90 save %sp, -112, %sp 20070ec: ba 10 00 18 mov %i0, %i5 const pthread_rwlockattr_t *the_attr; /* * Error check parameters */ if ( !rwlock ) 20070f0: 80 a7 60 00 cmp %i5, 0 20070f4: 02 80 00 1d be 2007168 20070f8: b0 10 20 16 mov 0x16, %i0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 20070fc: 80 a6 60 00 cmp %i1, 0 2007100: 32 80 00 06 bne,a 2007118 2007104: c2 06 40 00 ld [ %i1 ], %g1 the_attr = attr; } else { (void) pthread_rwlockattr_init( &default_attr ); 2007108: 90 07 bf f4 add %fp, -12, %o0 200710c: 40 00 02 80 call 2007b0c 2007110: 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 ) 2007114: c2 06 40 00 ld [ %i1 ], %g1 2007118: 80 a0 60 00 cmp %g1, 0 200711c: 02 80 00 13 be 2007168 <== NEVER TAKEN 2007120: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 2007124: c2 06 60 04 ld [ %i1 + 4 ], %g1 2007128: 80 a0 60 00 cmp %g1, 0 200712c: 12 80 00 0f bne 2007168 <== NEVER TAKEN 2007130: 03 00 80 67 sethi %hi(0x2019c00), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2007134: c4 00 60 c0 ld [ %g1 + 0xc0 ], %g2 ! 2019cc0 <_Thread_Dispatch_disable_level> */ RTEMS_INLINE_ROUTINE void _CORE_RWLock_Initialize_attributes( CORE_RWLock_Attributes *the_attributes ) { the_attributes->XXX = 0; 2007138: c0 27 bf fc clr [ %fp + -4 ] 200713c: 84 00 a0 01 inc %g2 2007140: c4 20 60 c0 st %g2, [ %g1 + 0xc0 ] return _Thread_Dispatch_disable_level; 2007144: c2 00 60 c0 ld [ %g1 + 0xc0 ], %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 *) 2007148: 37 00 80 67 sethi %hi(0x2019c00), %i3 200714c: 40 00 09 fb call 2009938 <_Objects_Allocate> 2007150: 90 16 e2 c0 or %i3, 0x2c0, %o0 ! 2019ec0 <_POSIX_RWLock_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_rwlock = _POSIX_RWLock_Allocate(); if ( !the_rwlock ) { 2007154: b8 92 20 00 orcc %o0, 0, %i4 2007158: 12 80 00 06 bne 2007170 200715c: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); 2007160: 40 00 0e c2 call 200ac68 <_Thread_Enable_dispatch> 2007164: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2007168: 81 c7 e0 08 ret 200716c: 81 e8 00 00 restore } _CORE_RWLock_Initialize( &the_rwlock->RWLock, &the_attributes ); 2007170: 40 00 07 a1 call 2008ff4 <_CORE_RWLock_Initialize> 2007174: 92 07 bf fc add %fp, -4, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007178: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 *rwlock = the_rwlock->Object.id; _Thread_Enable_dispatch(); return 0; } 200717c: b6 16 e2 c0 or %i3, 0x2c0, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007180: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007184: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007188: 85 28 a0 02 sll %g2, 2, %g2 200718c: 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; 2007190: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_RWLock_Information, &the_rwlock->Object, 0 ); *rwlock = the_rwlock->Object.id; 2007194: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2007198: 40 00 0e b4 call 200ac68 <_Thread_Enable_dispatch> 200719c: b0 10 20 00 clr %i0 return 0; } 20071a0: 81 c7 e0 08 ret 20071a4: 81 e8 00 00 restore =============================================================================== 02007218 : int pthread_rwlock_timedrdlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 2007218: 9d e3 bf 98 save %sp, -104, %sp Watchdog_Interval ticks; bool do_wait = true; POSIX_Absolute_timeout_conversion_results_t status; if ( !rwlock ) return EINVAL; 200721c: ba 10 20 16 mov 0x16, %i5 Objects_Locations location; Watchdog_Interval ticks; bool do_wait = true; POSIX_Absolute_timeout_conversion_results_t status; if ( !rwlock ) 2007220: 80 a6 20 00 cmp %i0, 0 2007224: 02 80 00 2b be 20072d0 2007228: 90 10 00 19 mov %i1, %o0 * * 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 ); 200722c: 40 00 1a e2 call 200ddb4 <_POSIX_Absolute_timeout_to_ticks> 2007230: 92 07 bf fc add %fp, -4, %o1 2007234: d2 06 00 00 ld [ %i0 ], %o1 2007238: b8 10 00 08 mov %o0, %i4 200723c: 94 07 bf f8 add %fp, -8, %o2 2007240: 11 00 80 67 sethi %hi(0x2019c00), %o0 2007244: 40 00 0a f8 call 2009e24 <_Objects_Get> 2007248: 90 12 22 c0 or %o0, 0x2c0, %o0 ! 2019ec0 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 200724c: c2 07 bf f8 ld [ %fp + -8 ], %g1 2007250: 80 a0 60 00 cmp %g1, 0 2007254: 12 80 00 1f bne 20072d0 2007258: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_reading( 200725c: 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, 2007260: 82 1f 20 03 xor %i4, 3, %g1 2007264: 90 02 20 10 add %o0, 0x10, %o0 2007268: 80 a0 00 01 cmp %g0, %g1 200726c: 98 10 20 00 clr %o4 2007270: b6 60 3f ff subx %g0, -1, %i3 2007274: 40 00 07 6a call 200901c <_CORE_RWLock_Obtain_for_reading> 2007278: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 200727c: 40 00 0e 7b call 200ac68 <_Thread_Enable_dispatch> 2007280: 01 00 00 00 nop if ( !do_wait ) { 2007284: 80 a6 e0 00 cmp %i3, 0 2007288: 12 80 00 0d bne 20072bc 200728c: 03 00 80 68 sethi %hi(0x201a000), %g1 if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 2007290: c2 00 62 04 ld [ %g1 + 0x204 ], %g1 ! 201a204 <_Per_CPU_Information+0xc> 2007294: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2007298: 80 a0 60 02 cmp %g1, 2 200729c: 32 80 00 09 bne,a 20072c0 20072a0: 03 00 80 68 sethi %hi(0x201a000), %g1 if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 20072a4: 80 a7 20 00 cmp %i4, 0 20072a8: 02 80 00 0a be 20072d0 <== NEVER TAKEN 20072ac: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 20072b0: 80 a7 20 01 cmp %i4, 1 20072b4: 08 80 00 07 bleu 20072d0 <== ALWAYS TAKEN 20072b8: ba 10 20 74 mov 0x74, %i5 return ETIMEDOUT; } } return _POSIX_RWLock_Translate_core_RWLock_return_code( (CORE_RWLock_Status) _Thread_Executing->Wait.return_code 20072bc: 03 00 80 68 sethi %hi(0x201a000), %g1 20072c0: c2 00 62 04 ld [ %g1 + 0x204 ], %g1 ! 201a204 <_Per_CPU_Information+0xc> status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } } return _POSIX_RWLock_Translate_core_RWLock_return_code( 20072c4: 40 00 00 35 call 2007398 <_POSIX_RWLock_Translate_core_RWLock_return_code> 20072c8: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 20072cc: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 20072d0: 81 c7 e0 08 ret 20072d4: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 020072d8 : int pthread_rwlock_timedwrlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 20072d8: 9d e3 bf 98 save %sp, -104, %sp Watchdog_Interval ticks; bool do_wait = true; POSIX_Absolute_timeout_conversion_results_t status; if ( !rwlock ) return EINVAL; 20072dc: ba 10 20 16 mov 0x16, %i5 Objects_Locations location; Watchdog_Interval ticks; bool do_wait = true; POSIX_Absolute_timeout_conversion_results_t status; if ( !rwlock ) 20072e0: 80 a6 20 00 cmp %i0, 0 20072e4: 02 80 00 2b be 2007390 20072e8: 90 10 00 19 mov %i1, %o0 * * 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 ); 20072ec: 40 00 1a b2 call 200ddb4 <_POSIX_Absolute_timeout_to_ticks> 20072f0: 92 07 bf fc add %fp, -4, %o1 20072f4: d2 06 00 00 ld [ %i0 ], %o1 20072f8: b8 10 00 08 mov %o0, %i4 20072fc: 94 07 bf f8 add %fp, -8, %o2 2007300: 11 00 80 67 sethi %hi(0x2019c00), %o0 2007304: 40 00 0a c8 call 2009e24 <_Objects_Get> 2007308: 90 12 22 c0 or %o0, 0x2c0, %o0 ! 2019ec0 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 200730c: c2 07 bf f8 ld [ %fp + -8 ], %g1 2007310: 80 a0 60 00 cmp %g1, 0 2007314: 12 80 00 1f bne 2007390 2007318: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_writing( 200731c: 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, 2007320: 82 1f 20 03 xor %i4, 3, %g1 2007324: 90 02 20 10 add %o0, 0x10, %o0 2007328: 80 a0 00 01 cmp %g0, %g1 200732c: 98 10 20 00 clr %o4 2007330: b6 60 3f ff subx %g0, -1, %i3 2007334: 40 00 07 6e call 20090ec <_CORE_RWLock_Obtain_for_writing> 2007338: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 200733c: 40 00 0e 4b call 200ac68 <_Thread_Enable_dispatch> 2007340: 01 00 00 00 nop if ( !do_wait && 2007344: 80 a6 e0 00 cmp %i3, 0 2007348: 12 80 00 0d bne 200737c 200734c: 03 00 80 68 sethi %hi(0x201a000), %g1 (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { 2007350: c2 00 62 04 ld [ %g1 + 0x204 ], %g1 ! 201a204 <_Per_CPU_Information+0xc> ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait && 2007354: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2007358: 80 a0 60 02 cmp %g1, 2 200735c: 32 80 00 09 bne,a 2007380 2007360: 03 00 80 68 sethi %hi(0x201a000), %g1 (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 2007364: 80 a7 20 00 cmp %i4, 0 2007368: 02 80 00 0a be 2007390 <== NEVER TAKEN 200736c: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2007370: 80 a7 20 01 cmp %i4, 1 2007374: 08 80 00 07 bleu 2007390 <== ALWAYS TAKEN 2007378: ba 10 20 74 mov 0x74, %i5 status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return _POSIX_RWLock_Translate_core_RWLock_return_code( (CORE_RWLock_Status) _Thread_Executing->Wait.return_code 200737c: 03 00 80 68 sethi %hi(0x201a000), %g1 2007380: c2 00 62 04 ld [ %g1 + 0x204 ], %g1 ! 201a204 <_Per_CPU_Information+0xc> if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } return _POSIX_RWLock_Translate_core_RWLock_return_code( 2007384: 40 00 00 05 call 2007398 <_POSIX_RWLock_Translate_core_RWLock_return_code> 2007388: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 200738c: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 2007390: 81 c7 e0 08 ret 2007394: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02007b34 : int pthread_rwlockattr_setpshared( pthread_rwlockattr_t *attr, int pshared ) { 2007b34: 82 10 00 08 mov %o0, %g1 if ( !attr ) 2007b38: 80 a0 60 00 cmp %g1, 0 2007b3c: 02 80 00 0a be 2007b64 2007b40: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2007b44: c4 00 40 00 ld [ %g1 ], %g2 2007b48: 80 a0 a0 00 cmp %g2, 0 2007b4c: 02 80 00 06 be 2007b64 2007b50: 80 a2 60 01 cmp %o1, 1 return EINVAL; switch ( pshared ) { 2007b54: 18 80 00 04 bgu 2007b64 <== NEVER TAKEN 2007b58: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 2007b5c: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; 2007b60: 90 10 20 00 clr %o0 default: return EINVAL; } } 2007b64: 81 c3 e0 08 retl =============================================================================== 02008a7c : int pthread_setschedparam( pthread_t thread, int policy, struct sched_param *param ) { 2008a7c: 9d e3 bf 90 save %sp, -112, %sp 2008a80: ba 10 00 18 mov %i0, %i5 int rc; /* * Check all the parameters */ if ( !param ) 2008a84: 80 a6 a0 00 cmp %i2, 0 2008a88: 02 80 00 3d be 2008b7c 2008a8c: b0 10 20 16 mov 0x16, %i0 return EINVAL; rc = _POSIX_Thread_Translate_sched_param( 2008a90: 90 10 00 19 mov %i1, %o0 2008a94: 92 10 00 1a mov %i2, %o1 2008a98: 94 07 bf f4 add %fp, -12, %o2 2008a9c: 40 00 18 8c call 200eccc <_POSIX_Thread_Translate_sched_param> 2008aa0: 96 07 bf f8 add %fp, -8, %o3 policy, param, &budget_algorithm, &budget_callout ); if ( rc ) 2008aa4: b0 92 20 00 orcc %o0, 0, %i0 2008aa8: 12 80 00 35 bne 2008b7c 2008aac: 90 10 00 1d mov %i5, %o0 return rc; /* * Actually change the scheduling policy and parameters */ the_thread = _Thread_Get( thread, &location ); 2008ab0: 40 00 0b da call 200ba18 <_Thread_Get> 2008ab4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2008ab8: c2 07 bf fc ld [ %fp + -4 ], %g1 2008abc: 80 a0 60 00 cmp %g1, 0 2008ac0: 12 80 00 31 bne 2008b84 2008ac4: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 2008ac8: fa 02 21 5c ld [ %o0 + 0x15c ], %i5 if ( api->schedpolicy == SCHED_SPORADIC ) 2008acc: c2 07 60 84 ld [ %i5 + 0x84 ], %g1 2008ad0: 80 a0 60 04 cmp %g1, 4 2008ad4: 32 80 00 05 bne,a 2008ae8 2008ad8: f2 27 60 84 st %i1, [ %i5 + 0x84 ] (void) _Watchdog_Remove( &api->Sporadic_timer ); 2008adc: 40 00 10 06 call 200caf4 <_Watchdog_Remove> 2008ae0: 90 07 60 a8 add %i5, 0xa8, %o0 api->schedpolicy = policy; 2008ae4: f2 27 60 84 st %i1, [ %i5 + 0x84 ] api->schedparam = *param; 2008ae8: 90 07 60 88 add %i5, 0x88, %o0 2008aec: 92 10 00 1a mov %i2, %o1 2008af0: 40 00 25 2c call 2011fa0 2008af4: 94 10 20 1c mov 0x1c, %o2 the_thread->budget_algorithm = budget_algorithm; 2008af8: c2 07 bf f4 ld [ %fp + -12 ], %g1 the_thread->budget_callout = budget_callout; switch ( api->schedpolicy ) { 2008afc: 80 a6 60 00 cmp %i1, 0 if ( api->schedpolicy == SCHED_SPORADIC ) (void) _Watchdog_Remove( &api->Sporadic_timer ); api->schedpolicy = policy; api->schedparam = *param; the_thread->budget_algorithm = budget_algorithm; 2008b00: c2 27 20 7c st %g1, [ %i4 + 0x7c ] the_thread->budget_callout = budget_callout; 2008b04: c2 07 bf f8 ld [ %fp + -8 ], %g1 switch ( api->schedpolicy ) { 2008b08: 06 80 00 1b bl 2008b74 <== NEVER TAKEN 2008b0c: c2 27 20 80 st %g1, [ %i4 + 0x80 ] 2008b10: 80 a6 60 02 cmp %i1, 2 2008b14: 04 80 00 07 ble 2008b30 2008b18: 03 00 80 6c sethi %hi(0x201b000), %g1 2008b1c: 80 a6 60 04 cmp %i1, 4 2008b20: 12 80 00 15 bne 2008b74 <== NEVER TAKEN 2008b24: 01 00 00 00 nop true ); break; case SCHED_SPORADIC: api->ss_high_priority = api->schedparam.sched_priority; 2008b28: 10 80 00 0d b 2008b5c 2008b2c: c2 07 60 88 ld [ %i5 + 0x88 ], %g1 switch ( api->schedpolicy ) { case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; 2008b30: c2 00 62 34 ld [ %g1 + 0x234 ], %g1 the_thread->real_priority = _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 2008b34: 90 10 00 1c mov %i4, %o0 switch ( api->schedpolicy ) { case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: the_thread->cpu_time_budget = _Thread_Ticks_per_timeslice; 2008b38: c2 27 20 78 st %g1, [ %i4 + 0x78 ] 2008b3c: 03 00 80 69 sethi %hi(0x201a400), %g1 2008b40: d2 08 61 7c ldub [ %g1 + 0x17c ], %o1 ! 201a57c 2008b44: c2 07 60 88 ld [ %i5 + 0x88 ], %g1 the_thread->real_priority = _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 2008b48: 94 10 20 01 mov 1, %o2 2008b4c: 92 22 40 01 sub %o1, %g1, %o1 2008b50: 40 00 0a 81 call 200b554 <_Thread_Change_priority> 2008b54: d2 27 20 18 st %o1, [ %i4 + 0x18 ] the_thread, the_thread->real_priority, true ); break; 2008b58: 30 80 00 07 b,a 2008b74 case SCHED_SPORADIC: api->ss_high_priority = api->schedparam.sched_priority; _Watchdog_Remove( &api->Sporadic_timer ); 2008b5c: 90 07 60 a8 add %i5, 0xa8, %o0 2008b60: 40 00 0f e5 call 200caf4 <_Watchdog_Remove> 2008b64: c2 27 60 a4 st %g1, [ %i5 + 0xa4 ] _POSIX_Threads_Sporadic_budget_TSR( 0, the_thread ); 2008b68: 90 10 20 00 clr %o0 2008b6c: 7f ff ff 80 call 200896c <_POSIX_Threads_Sporadic_budget_TSR> 2008b70: 92 10 00 1c mov %i4, %o1 break; } _Thread_Enable_dispatch(); 2008b74: 40 00 0b 9c call 200b9e4 <_Thread_Enable_dispatch> 2008b78: 01 00 00 00 nop return 0; 2008b7c: 81 c7 e0 08 ret 2008b80: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } return ESRCH; 2008b84: b0 10 20 03 mov 3, %i0 } 2008b88: 81 c7 e0 08 ret 2008b8c: 81 e8 00 00 restore =============================================================================== 0200646c : /* * 18.2.2 Setting Cancelability State, P1003.1c/Draft 10, p. 183 */ void pthread_testcancel( void ) { 200646c: 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() ) 2006470: 03 00 80 5f sethi %hi(0x2017c00), %g1 2006474: 82 10 63 e8 or %g1, 0x3e8, %g1 ! 2017fe8 <_Per_CPU_Information> 2006478: c4 00 60 08 ld [ %g1 + 8 ], %g2 200647c: 80 a0 a0 00 cmp %g2, 0 2006480: 12 80 00 19 bne 20064e4 <== NEVER TAKEN 2006484: 01 00 00 00 nop return; thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 2006488: c2 00 60 0c ld [ %g1 + 0xc ], %g1 200648c: c4 00 61 5c ld [ %g1 + 0x15c ], %g2 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2006490: 03 00 80 5e sethi %hi(0x2017800), %g1 2006494: c6 00 62 b0 ld [ %g1 + 0x2b0 ], %g3 ! 2017ab0 <_Thread_Dispatch_disable_level> 2006498: 86 00 e0 01 inc %g3 200649c: c6 20 62 b0 st %g3, [ %g1 + 0x2b0 ] return _Thread_Dispatch_disable_level; 20064a0: c2 00 62 b0 ld [ %g1 + 0x2b0 ], %g1 _Thread_Disable_dispatch(); if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 20064a4: c2 00 a0 d8 ld [ %g2 + 0xd8 ], %g1 20064a8: 80 a0 60 00 cmp %g1, 0 20064ac: 12 80 00 05 bne 20064c0 <== NEVER TAKEN 20064b0: ba 10 20 00 clr %i5 /* Setting Cancelability State, P1003.1c/Draft 10, p. 183 */ int _EXFUN(pthread_setcancelstate, (int __state, int *__oldstate)); int _EXFUN(pthread_setcanceltype, (int __type, int *__oldtype)); void _EXFUN(pthread_testcancel, (void)); 20064b4: c2 00 a0 e0 ld [ %g2 + 0xe0 ], %g1 20064b8: 80 a0 00 01 cmp %g0, %g1 20064bc: ba 40 20 00 addx %g0, 0, %i5 thread_support->cancelation_requested ) cancel = true; _Thread_Enable_dispatch(); 20064c0: 40 00 0b 70 call 2009280 <_Thread_Enable_dispatch> 20064c4: 01 00 00 00 nop if ( cancel ) 20064c8: 80 8f 60 ff btst 0xff, %i5 20064cc: 02 80 00 06 be 20064e4 20064d0: 01 00 00 00 nop _POSIX_Thread_Exit( _Thread_Executing, PTHREAD_CANCELED ); 20064d4: 03 00 80 5f sethi %hi(0x2017c00), %g1 20064d8: f0 00 63 f4 ld [ %g1 + 0x3f4 ], %i0 ! 2017ff4 <_Per_CPU_Information+0xc> 20064dc: 40 00 18 6c call 200c68c <_POSIX_Thread_Exit> 20064e0: 93 e8 3f ff restore %g0, -1, %o1 20064e4: 81 c7 e0 08 ret 20064e8: 81 e8 00 00 restore =============================================================================== 02006fa4 : * errno - otherwise */ int rtems_aio_enqueue (rtems_aio_request *req) { 2006fa4: 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); 2006fa8: 3b 00 80 62 sethi %hi(0x2018800), %i5 2006fac: 40 00 02 77 call 2007988 2006fb0: 90 17 63 2c or %i5, 0x32c, %o0 ! 2018b2c if (result != 0) { 2006fb4: b8 92 20 00 orcc %o0, 0, %i4 2006fb8: 02 80 00 06 be 2006fd0 <== ALWAYS TAKEN 2006fbc: 01 00 00 00 nop free (req); 2006fc0: 7f ff f1 72 call 2003588 <== NOT EXECUTED 2006fc4: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED return result; 2006fc8: 81 c7 e0 08 ret <== NOT EXECUTED 2006fcc: 91 e8 00 1c restore %g0, %i4, %o0 <== NOT EXECUTED } /* _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); 2006fd0: 40 00 04 73 call 200819c 2006fd4: ba 17 63 2c or %i5, 0x32c, %i5 2006fd8: 92 07 bf fc add %fp, -4, %o1 2006fdc: 40 00 03 7c call 2007dcc 2006fe0: 94 07 bf dc add %fp, -36, %o2 req->caller_thread = pthread_self (); 2006fe4: 40 00 04 6e call 200819c 2006fe8: 01 00 00 00 nop req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2006fec: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2006ff0: c6 07 bf dc ld [ %fp + -36 ], %g3 2006ff4: c4 00 60 18 ld [ %g1 + 0x18 ], %g2 /* _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 (); 2006ff8: d0 26 20 10 st %o0, [ %i0 + 0x10 ] req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2006ffc: 84 20 c0 02 sub %g3, %g2, %g2 2007000: c4 26 20 0c st %g2, [ %i0 + 0xc ] req->policy = policy; 2007004: c4 07 bf fc ld [ %fp + -4 ], %g2 2007008: c4 26 20 08 st %g2, [ %i0 + 8 ] req->aiocbp->error_code = EINPROGRESS; 200700c: 84 10 20 77 mov 0x77, %g2 2007010: c4 20 60 34 st %g2, [ %g1 + 0x34 ] req->aiocbp->return_value = 0; if ((aio_request_queue.idle_threads == 0) && 2007014: c4 07 60 68 ld [ %i5 + 0x68 ], %g2 req->caller_thread = pthread_self (); req->priority = param.sched_priority - req->aiocbp->aio_reqprio; req->policy = policy; req->aiocbp->error_code = EINPROGRESS; req->aiocbp->return_value = 0; 2007018: c0 20 60 38 clr [ %g1 + 0x38 ] if ((aio_request_queue.idle_threads == 0) && 200701c: 80 a0 a0 00 cmp %g2, 0 2007020: 12 80 00 33 bne 20070ec <== NEVER TAKEN 2007024: d2 00 40 00 ld [ %g1 ], %o1 2007028: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 200702c: 80 a0 60 04 cmp %g1, 4 2007030: 14 80 00 30 bg 20070f0 2007034: 11 00 80 62 sethi %hi(0x2018800), %o0 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); 2007038: 90 07 60 48 add %i5, 0x48, %o0 200703c: 7f ff fe c4 call 2006b4c 2007040: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2007044: c2 02 20 18 ld [ %o0 + 0x18 ], %g1 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); 2007048: b6 10 00 08 mov %o0, %i3 if (r_chain->new_fd == 1) { 200704c: 80 a0 60 01 cmp %g1, 1 2007050: 12 80 00 1d bne 20070c4 2007054: b4 02 20 08 add %o0, 8, %i2 RTEMS_INLINE_ROUTINE void _Chain_Prepend( Chain_Control *the_chain, Chain_Node *the_node ) { _Chain_Insert(_Chain_Head(the_chain), the_node); 2007058: 90 10 00 1a mov %i2, %o0 200705c: 40 00 08 d2 call 20093a4 <_Chain_Insert> 2007060: 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); 2007064: 90 06 e0 1c add %i3, 0x1c, %o0 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; 2007068: c0 26 e0 18 clr [ %i3 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 200706c: 40 00 01 f1 call 2007830 2007070: 92 10 20 00 clr %o1 pthread_cond_init (&r_chain->cond, NULL); 2007074: 90 06 e0 20 add %i3, 0x20, %o0 2007078: 40 00 00 fa call 2007460 200707c: 92 10 20 00 clr %o1 AIO_printf ("New thread \n"); result = pthread_create (&thid, &aio_request_queue.attr, 2007080: 96 10 00 1b mov %i3, %o3 2007084: 90 07 bf f8 add %fp, -8, %o0 2007088: 92 07 60 08 add %i5, 8, %o1 200708c: 15 00 80 1b sethi %hi(0x2006c00), %o2 2007090: 40 00 02 bf call 2007b8c 2007094: 94 12 a0 38 or %o2, 0x38, %o2 ! 2006c38 rtems_aio_handle, (void *) r_chain); if (result != 0) { 2007098: b6 92 20 00 orcc %o0, 0, %i3 200709c: 22 80 00 07 be,a 20070b8 <== ALWAYS TAKEN 20070a0: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 pthread_mutex_unlock (&aio_request_queue.mutex); 20070a4: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 20070a8: 40 00 02 58 call 2007a08 <== NOT EXECUTED 20070ac: b8 10 00 1b mov %i3, %i4 <== NOT EXECUTED return result; 20070b0: 81 c7 e0 08 ret <== NOT EXECUTED 20070b4: 91 e8 00 1c restore %g0, %i4, %o0 <== NOT EXECUTED } ++aio_request_queue.active_threads; 20070b8: 82 00 60 01 inc %g1 20070bc: 10 80 00 40 b 20071bc 20070c0: c2 27 60 64 st %g1, [ %i5 + 0x64 ] } else { /* put request in the fd chain it belongs to */ pthread_mutex_lock (&r_chain->mutex); 20070c4: ba 02 20 1c add %o0, 0x1c, %i5 20070c8: 40 00 02 30 call 2007988 20070cc: 90 10 00 1d mov %i5, %o0 rtems_aio_insert_prio (&r_chain->perfd, req); 20070d0: 90 10 00 1a mov %i2, %o0 20070d4: 7f ff ff 6d call 2006e88 20070d8: 92 10 00 18 mov %i0, %o1 pthread_cond_signal (&r_chain->cond); 20070dc: 40 00 01 10 call 200751c 20070e0: 90 06 e0 20 add %i3, 0x20, %o0 pthread_mutex_unlock (&r_chain->mutex); 20070e4: 10 80 00 11 b 2007128 20070e8: 90 10 00 1d mov %i5, %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, 20070ec: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 20070f0: 94 10 20 00 clr %o2 20070f4: 7f ff fe 96 call 2006b4c 20070f8: 90 12 23 74 or %o0, 0x374, %o0 req->aiocbp->aio_fildes, 0); if (r_chain != NULL) 20070fc: ba 92 20 00 orcc %o0, 0, %i5 2007100: 02 80 00 0e be 2007138 2007104: b6 07 60 1c add %i5, 0x1c, %i3 { pthread_mutex_lock (&r_chain->mutex); 2007108: 40 00 02 20 call 2007988 200710c: 90 10 00 1b mov %i3, %o0 rtems_aio_insert_prio (&r_chain->perfd, req); 2007110: 90 07 60 08 add %i5, 8, %o0 2007114: 7f ff ff 5d call 2006e88 2007118: 92 10 00 18 mov %i0, %o1 pthread_cond_signal (&r_chain->cond); 200711c: 40 00 01 00 call 200751c 2007120: 90 07 60 20 add %i5, 0x20, %o0 pthread_mutex_unlock (&r_chain->mutex); 2007124: 90 10 00 1b mov %i3, %o0 2007128: 40 00 02 38 call 2007a08 200712c: 01 00 00 00 nop if (aio_request_queue.idle_threads > 0) pthread_cond_signal (&aio_request_queue.new_req); } } pthread_mutex_unlock (&aio_request_queue.mutex); 2007130: 10 80 00 24 b 20071c0 2007134: 11 00 80 62 sethi %hi(0x2018800), %o0 } else { /* or to the idle chain */ chain = &aio_request_queue.idle_req; r_chain = rtems_aio_search_fd (chain, req->aiocbp->aio_fildes, 1); 2007138: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200713c: 11 00 80 62 sethi %hi(0x2018800), %o0 2007140: d2 00 40 00 ld [ %g1 ], %o1 2007144: 90 12 23 80 or %o0, 0x380, %o0 2007148: 7f ff fe 81 call 2006b4c 200714c: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2007150: 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); 2007154: ba 10 00 08 mov %o0, %i5 2007158: 92 10 00 18 mov %i0, %o1 if (r_chain->new_fd == 1) { 200715c: 80 a0 60 01 cmp %g1, 1 2007160: 12 80 00 0d bne 2007194 2007164: 90 02 20 08 add %o0, 8, %o0 2007168: 40 00 08 8f call 20093a4 <_Chain_Insert> 200716c: 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); 2007170: 90 07 60 1c add %i5, 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; 2007174: c0 27 60 18 clr [ %i5 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 2007178: 40 00 01 ae call 2007830 200717c: 92 10 20 00 clr %o1 pthread_cond_init (&r_chain->cond, NULL); 2007180: 90 07 60 20 add %i5, 0x20, %o0 2007184: 40 00 00 b7 call 2007460 2007188: 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) 200718c: 10 80 00 05 b 20071a0 2007190: 11 00 80 62 sethi %hi(0x2018800), %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); 2007194: 7f ff ff 3d call 2006e88 2007198: 01 00 00 00 nop if (aio_request_queue.idle_threads > 0) 200719c: 11 00 80 62 sethi %hi(0x2018800), %o0 20071a0: 90 12 23 2c or %o0, 0x32c, %o0 ! 2018b2c 20071a4: c2 02 20 68 ld [ %o0 + 0x68 ], %g1 20071a8: 80 a0 60 00 cmp %g1, 0 20071ac: 24 80 00 05 ble,a 20071c0 <== ALWAYS TAKEN 20071b0: 11 00 80 62 sethi %hi(0x2018800), %o0 pthread_cond_signal (&aio_request_queue.new_req); 20071b4: 40 00 00 da call 200751c <== NOT EXECUTED 20071b8: 90 02 20 04 add %o0, 4, %o0 ! 2018804 <== NOT EXECUTED } } pthread_mutex_unlock (&aio_request_queue.mutex); 20071bc: 11 00 80 62 sethi %hi(0x2018800), %o0 20071c0: 40 00 02 12 call 2007a08 20071c4: 90 12 23 2c or %o0, 0x32c, %o0 ! 2018b2c return 0; } 20071c8: b0 10 00 1c mov %i4, %i0 20071cc: 81 c7 e0 08 ret 20071d0: 81 e8 00 00 restore =============================================================================== 02006c38 : * NULL - if error */ static void * rtems_aio_handle (void *arg) { 2006c38: 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); 2006c3c: 3b 00 80 62 sethi %hi(0x2018800), %i5 default: result = -1; } if (result == -1) { req->aiocbp->return_value = -1; 2006c40: b6 10 3f ff mov -1, %i3 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); 2006c44: ba 17 63 2c or %i5, 0x32c, %i5 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)) { 2006c48: b2 07 60 58 add %i5, 0x58, %i1 --aio_request_queue.active_threads; clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 2006c4c: b4 07 60 04 add %i5, 4, %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); 2006c50: a0 06 20 1c add %i0, 0x1c, %l0 2006c54: 40 00 03 4d call 2007988 2006c58: 90 10 00 10 mov %l0, %o0 if (result != 0) 2006c5c: 80 a2 20 00 cmp %o0, 0 2006c60: 12 80 00 87 bne 2006e7c <== NEVER TAKEN 2006c64: 82 06 20 0c add %i0, 0xc, %g1 */ RTEMS_INLINE_ROUTINE const Chain_Node *_Chain_Immutable_first( const Chain_Control *the_chain ) { return _Chain_Immutable_head( the_chain )->next; 2006c68: f8 06 20 08 ld [ %i0 + 8 ], %i4 /* 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)) { 2006c6c: 80 a7 00 01 cmp %i4, %g1 2006c70: 02 80 00 3a be 2006d58 2006c74: 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); 2006c78: 40 00 05 49 call 200819c 2006c7c: 01 00 00 00 nop 2006c80: 92 07 bf fc add %fp, -4, %o1 2006c84: 40 00 04 52 call 2007dcc 2006c88: 94 07 bf d8 add %fp, -40, %o2 param.sched_priority = req->priority; 2006c8c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 pthread_setschedparam (pthread_self(), req->policy, ¶m); 2006c90: 40 00 05 43 call 200819c 2006c94: c2 27 bf d8 st %g1, [ %fp + -40 ] 2006c98: d2 07 20 08 ld [ %i4 + 8 ], %o1 2006c9c: 40 00 05 44 call 20081ac 2006ca0: 94 07 bf d8 add %fp, -40, %o2 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2006ca4: 40 00 09 a8 call 2009344 <_Chain_Extract> 2006ca8: 90 10 00 1c mov %i4, %o0 rtems_chain_extract (node); pthread_mutex_unlock (&r_chain->mutex); 2006cac: 40 00 03 57 call 2007a08 2006cb0: 90 10 00 10 mov %l0, %o0 switch (req->aiocbp->aio_lio_opcode) { 2006cb4: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 2006cb8: c4 00 60 30 ld [ %g1 + 0x30 ], %g2 2006cbc: 80 a0 a0 02 cmp %g2, 2 2006cc0: 22 80 00 10 be,a 2006d00 2006cc4: c4 18 60 08 ldd [ %g1 + 8 ], %g2 2006cc8: 80 a0 a0 03 cmp %g2, 3 2006ccc: 02 80 00 15 be 2006d20 <== NEVER TAKEN 2006cd0: 80 a0 a0 01 cmp %g2, 1 2006cd4: 32 80 00 19 bne,a 2006d38 <== NEVER TAKEN 2006cd8: f8 07 20 14 ld [ %i4 + 0x14 ], %i4 <== NOT EXECUTED case LIO_READ: AIO_printf ("read\n"); result = pread (req->aiocbp->aio_fildes, 2006cdc: c4 18 60 08 ldd [ %g1 + 8 ], %g2 2006ce0: d0 00 40 00 ld [ %g1 ], %o0 2006ce4: d2 00 60 10 ld [ %g1 + 0x10 ], %o1 2006ce8: d4 00 60 14 ld [ %g1 + 0x14 ], %o2 2006cec: 96 10 00 02 mov %g2, %o3 2006cf0: 40 00 2b dc call 2011c60 2006cf4: 98 10 00 03 mov %g3, %o4 (void *) req->aiocbp->aio_buf, req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; 2006cf8: 10 80 00 0d b 2006d2c 2006cfc: 80 a2 3f ff cmp %o0, -1 case LIO_WRITE: AIO_printf ("write\n"); result = pwrite (req->aiocbp->aio_fildes, 2006d00: d0 00 40 00 ld [ %g1 ], %o0 2006d04: d2 00 60 10 ld [ %g1 + 0x10 ], %o1 2006d08: d4 00 60 14 ld [ %g1 + 0x14 ], %o2 2006d0c: 96 10 00 02 mov %g2, %o3 2006d10: 40 00 2c 12 call 2011d58 2006d14: 98 10 00 03 mov %g3, %o4 (void *) req->aiocbp->aio_buf, req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; 2006d18: 10 80 00 05 b 2006d2c 2006d1c: 80 a2 3f ff cmp %o0, -1 case LIO_SYNC: AIO_printf ("sync\n"); result = fsync (req->aiocbp->aio_fildes); 2006d20: 40 00 1b c3 call 200dc2c <== NOT EXECUTED 2006d24: d0 00 40 00 ld [ %g1 ], %o0 <== NOT EXECUTED break; default: result = -1; } if (result == -1) { 2006d28: 80 a2 3f ff cmp %o0, -1 <== NOT EXECUTED 2006d2c: 32 80 00 08 bne,a 2006d4c <== ALWAYS TAKEN 2006d30: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 req->aiocbp->return_value = -1; 2006d34: f8 07 20 14 ld [ %i4 + 0x14 ], %i4 <== NOT EXECUTED req->aiocbp->error_code = errno; 2006d38: 40 00 28 a7 call 2010fd4 <__errno> <== NOT EXECUTED 2006d3c: f6 27 20 38 st %i3, [ %i4 + 0x38 ] <== NOT EXECUTED 2006d40: c2 02 00 00 ld [ %o0 ], %g1 <== NOT EXECUTED 2006d44: 10 bf ff c3 b 2006c50 <== NOT EXECUTED 2006d48: c2 27 20 34 st %g1, [ %i4 + 0x34 ] <== NOT EXECUTED } else { req->aiocbp->return_value = result; 2006d4c: d0 20 60 38 st %o0, [ %g1 + 0x38 ] req->aiocbp->error_code = 0; 2006d50: 10 bf ff c0 b 2006c50 2006d54: c0 20 60 34 clr [ %g1 + 0x34 ] struct timespec timeout; AIO_printf ("Chain is empty [WQ], wait for work\n"); pthread_mutex_unlock (&r_chain->mutex); 2006d58: 40 00 03 2c call 2007a08 2006d5c: 90 10 00 10 mov %l0, %o0 pthread_mutex_lock (&aio_request_queue.mutex); 2006d60: 40 00 03 0a call 2007988 2006d64: 90 10 00 1d mov %i5, %o0 if (rtems_chain_is_empty (chain)) 2006d68: c2 06 20 08 ld [ %i0 + 8 ], %g1 2006d6c: 80 a0 40 1c cmp %g1, %i4 2006d70: 12 80 00 3f bne 2006e6c <== NEVER TAKEN 2006d74: 92 07 bf f4 add %fp, -12, %o1 { clock_gettime (CLOCK_REALTIME, &timeout); 2006d78: 40 00 01 62 call 2007300 2006d7c: 90 10 20 01 mov 1, %o0 timeout.tv_sec += 3; 2006d80: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 2006d84: 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; 2006d88: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 2006d8c: b8 06 20 20 add %i0, 0x20, %i4 pthread_mutex_lock (&aio_request_queue.mutex); if (rtems_chain_is_empty (chain)) { clock_gettime (CLOCK_REALTIME, &timeout); timeout.tv_sec += 3; 2006d90: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 2006d94: 90 10 00 1c mov %i4, %o0 2006d98: 92 10 00 1d mov %i5, %o1 2006d9c: 40 00 01 fd call 2007590 2006da0: 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) { 2006da4: 80 a2 20 74 cmp %o0, 0x74 2006da8: 12 80 00 31 bne 2006e6c <== NEVER TAKEN 2006dac: 01 00 00 00 nop 2006db0: 40 00 09 65 call 2009344 <_Chain_Extract> 2006db4: 90 10 00 18 mov %i0, %o0 rtems_chain_extract (&r_chain->next_fd); pthread_mutex_destroy (&r_chain->mutex); 2006db8: 40 00 02 4f call 20076f4 2006dbc: 90 10 00 10 mov %l0, %o0 pthread_cond_destroy (&r_chain->cond); 2006dc0: 40 00 01 74 call 2007390 2006dc4: 90 10 00 1c mov %i4, %o0 free (r_chain); 2006dc8: 7f ff f1 f0 call 2003588 2006dcc: 90 10 00 18 mov %i0, %o0 /* 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)) { 2006dd0: c2 07 60 54 ld [ %i5 + 0x54 ], %g1 2006dd4: 80 a0 40 19 cmp %g1, %i1 2006dd8: 12 80 00 1b bne 2006e44 2006ddc: c2 07 60 68 ld [ %i5 + 0x68 ], %g1 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); 2006de0: 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; 2006de4: 82 00 60 01 inc %g1 2006de8: c2 27 60 68 st %g1, [ %i5 + 0x68 ] --aio_request_queue.active_threads; 2006dec: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 clock_gettime (CLOCK_REALTIME, &timeout); 2006df0: 90 10 20 01 mov 1, %o0 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; 2006df4: 82 00 7f ff add %g1, -1, %g1 clock_gettime (CLOCK_REALTIME, &timeout); 2006df8: 40 00 01 42 call 2007300 2006dfc: c2 27 60 64 st %g1, [ %i5 + 0x64 ] timeout.tv_sec += 3; 2006e00: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 2006e04: 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; 2006e08: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 2006e0c: 90 10 00 1a mov %i2, %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; 2006e10: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 2006e14: 92 10 00 1d mov %i5, %o1 2006e18: 40 00 01 de call 2007590 2006e1c: 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) { 2006e20: 80 a2 20 74 cmp %o0, 0x74 2006e24: 12 80 00 08 bne 2006e44 <== NEVER TAKEN 2006e28: c2 07 60 68 ld [ %i5 + 0x68 ], %g1 AIO_printf ("Etimeout\n"); --aio_request_queue.idle_threads; pthread_mutex_unlock (&aio_request_queue.mutex); 2006e2c: 90 10 00 1d mov %i5, %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; 2006e30: 82 00 7f ff add %g1, -1, %g1 pthread_mutex_unlock (&aio_request_queue.mutex); 2006e34: 40 00 02 f5 call 2007a08 2006e38: c2 27 60 68 st %g1, [ %i5 + 0x68 ] return NULL; 2006e3c: 81 c7 e0 08 ret 2006e40: 91 e8 20 00 restore %g0, 0, %o0 */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2006e44: f0 07 60 54 ld [ %i5 + 0x54 ], %i0 } } /* 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; 2006e48: 82 00 7f ff add %g1, -1, %g1 2006e4c: c2 27 60 68 st %g1, [ %i5 + 0x68 ] ++aio_request_queue.active_threads; 2006e50: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 2006e54: 90 10 00 18 mov %i0, %o0 2006e58: 82 00 60 01 inc %g1 2006e5c: 40 00 09 3a call 2009344 <_Chain_Extract> 2006e60: c2 27 60 64 st %g1, [ %i5 + 0x64 ] node = rtems_chain_first (&aio_request_queue.idle_req); rtems_chain_extract (node); r_chain = (rtems_aio_request_chain *) node; rtems_aio_move_to_work (r_chain); 2006e64: 7f ff ff 65 call 2006bf8 2006e68: 90 10 00 18 mov %i0, %o0 } } /* 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); 2006e6c: 40 00 02 e7 call 2007a08 2006e70: 90 10 00 1d mov %i5, %o0 /* 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); 2006e74: 10 bf ff 78 b 2006c54 2006e78: a0 06 20 1c add %i0, 0x1c, %l0 } } AIO_printf ("Thread finished\n"); return NULL; } 2006e7c: b0 10 20 00 clr %i0 <== NOT EXECUTED 2006e80: 81 c7 e0 08 ret <== NOT EXECUTED 2006e84: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02006a6c : * 0 - if initialization succeeded */ int rtems_aio_init (void) { 2006a6c: 9d e3 bf a0 save %sp, -96, %sp int result = 0; result = pthread_attr_init (&aio_request_queue.attr); 2006a70: 3b 00 80 62 sethi %hi(0x2018800), %i5 2006a74: 40 00 04 2c call 2007b24 2006a78: 90 17 63 34 or %i5, 0x334, %o0 ! 2018b34 if (result != 0) 2006a7c: b0 92 20 00 orcc %o0, 0, %i0 2006a80: 12 80 00 31 bne 2006b44 <== NEVER TAKEN 2006a84: 90 17 63 34 or %i5, 0x334, %o0 return result; result = 2006a88: 40 00 04 33 call 2007b54 2006a8c: 92 10 20 00 clr %o1 pthread_attr_setdetachstate (&aio_request_queue.attr, PTHREAD_CREATE_DETACHED); if (result != 0) 2006a90: 80 a2 20 00 cmp %o0, 0 2006a94: 22 80 00 05 be,a 2006aa8 <== ALWAYS TAKEN 2006a98: 11 00 80 62 sethi %hi(0x2018800), %o0 pthread_attr_destroy (&aio_request_queue.attr); 2006a9c: 40 00 04 16 call 2007af4 <== NOT EXECUTED 2006aa0: 90 17 63 34 or %i5, 0x334, %o0 <== NOT EXECUTED result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 2006aa4: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 2006aa8: 92 10 20 00 clr %o1 2006aac: 40 00 03 61 call 2007830 2006ab0: 90 12 23 2c or %o0, 0x32c, %o0 if (result != 0) 2006ab4: 80 a2 20 00 cmp %o0, 0 2006ab8: 22 80 00 06 be,a 2006ad0 <== ALWAYS TAKEN 2006abc: 11 00 80 62 sethi %hi(0x2018800), %o0 pthread_attr_destroy (&aio_request_queue.attr); 2006ac0: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 2006ac4: 40 00 04 0c call 2007af4 <== NOT EXECUTED 2006ac8: 90 12 23 34 or %o0, 0x334, %o0 ! 2018b34 <== NOT EXECUTED result = pthread_cond_init (&aio_request_queue.new_req, NULL); 2006acc: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 2006ad0: 92 10 20 00 clr %o1 2006ad4: 40 00 02 63 call 2007460 2006ad8: 90 12 23 30 or %o0, 0x330, %o0 if (result != 0) { 2006adc: b0 92 20 00 orcc %o0, 0, %i0 2006ae0: 02 80 00 09 be 2006b04 <== ALWAYS TAKEN 2006ae4: 03 00 80 62 sethi %hi(0x2018800), %g1 pthread_mutex_destroy (&aio_request_queue.mutex); 2006ae8: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 2006aec: 40 00 03 02 call 20076f4 <== NOT EXECUTED 2006af0: 90 12 23 2c or %o0, 0x32c, %o0 ! 2018b2c <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 2006af4: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 2006af8: 40 00 03 ff call 2007af4 <== NOT EXECUTED 2006afc: 90 12 23 34 or %o0, 0x334, %o0 ! 2018b34 <== NOT EXECUTED ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2006b00: 03 00 80 62 sethi %hi(0x2018800), %g1 <== NOT EXECUTED 2006b04: 82 10 63 2c or %g1, 0x32c, %g1 ! 2018b2c 2006b08: 84 00 60 4c add %g1, 0x4c, %g2 2006b0c: c4 20 60 48 st %g2, [ %g1 + 0x48 ] head->previous = NULL; tail->previous = head; 2006b10: 84 00 60 48 add %g1, 0x48, %g2 2006b14: c4 20 60 50 st %g2, [ %g1 + 0x50 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2006b18: 84 00 60 58 add %g1, 0x58, %g2 2006b1c: c4 20 60 54 st %g2, [ %g1 + 0x54 ] head->previous = NULL; tail->previous = head; 2006b20: 84 00 60 54 add %g1, 0x54, %g2 { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; head->previous = NULL; 2006b24: c0 20 60 4c clr [ %g1 + 0x4c ] tail->previous = head; 2006b28: c4 20 60 5c st %g2, [ %g1 + 0x5c ] { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; head->previous = NULL; 2006b2c: c0 20 60 58 clr [ %g1 + 0x58 ] rtems_chain_initialize_empty (&aio_request_queue.work_req); rtems_chain_initialize_empty (&aio_request_queue.idle_req); aio_request_queue.active_threads = 0; aio_request_queue.idle_threads = 0; aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 2006b30: 05 00 00 2c sethi %hi(0xb000), %g2 } rtems_chain_initialize_empty (&aio_request_queue.work_req); rtems_chain_initialize_empty (&aio_request_queue.idle_req); aio_request_queue.active_threads = 0; 2006b34: c0 20 60 64 clr [ %g1 + 0x64 ] aio_request_queue.idle_threads = 0; aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 2006b38: 84 10 a0 0b or %g2, 0xb, %g2 rtems_chain_initialize_empty (&aio_request_queue.work_req); rtems_chain_initialize_empty (&aio_request_queue.idle_req); aio_request_queue.active_threads = 0; aio_request_queue.idle_threads = 0; 2006b3c: c0 20 60 68 clr [ %g1 + 0x68 ] aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 2006b40: c4 20 60 60 st %g2, [ %g1 + 0x60 ] return result; } 2006b44: 81 c7 e0 08 ret 2006b48: 81 e8 00 00 restore =============================================================================== 02006e88 : * NONE */ void rtems_aio_insert_prio (rtems_chain_control *chain, rtems_aio_request *req) { 2006e88: 9d e3 bf a0 save %sp, -96, %sp 2006e8c: 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 ); 2006e90: 86 06 20 04 add %i0, 4, %g3 rtems_chain_node *node; AIO_printf ("FD exists \n"); node = rtems_chain_first (chain); if (rtems_chain_is_empty (chain)) { 2006e94: 80 a0 40 03 cmp %g1, %g3 2006e98: 02 80 00 10 be 2006ed8 <== NEVER TAKEN 2006e9c: 84 10 00 19 mov %i1, %g2 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; 2006ea0: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 while (req->aiocbp->aio_reqprio > prio && 2006ea4: 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; 2006ea8: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 while (req->aiocbp->aio_reqprio > prio && 2006eac: 10 80 00 04 b 2006ebc 2006eb0: de 03 e0 18 ld [ %o7 + 0x18 ], %o7 !rtems_chain_is_tail (chain, node)) { node = rtems_chain_next (node); prio = ((rtems_aio_request *) node)->aiocbp->aio_reqprio; 2006eb4: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 <== NOT EXECUTED 2006eb8: c8 01 20 18 ld [ %g4 + 0x18 ], %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 && 2006ebc: 80 a3 c0 04 cmp %o7, %g4 2006ec0: 04 80 00 04 ble 2006ed0 <== ALWAYS TAKEN 2006ec4: 80 a0 40 03 cmp %g1, %g3 2006ec8: 32 bf ff fb bne,a 2006eb4 <== NOT EXECUTED 2006ecc: c2 00 40 00 ld [ %g1 ], %g1 <== NOT EXECUTED RTEMS_INLINE_ROUTINE void rtems_chain_insert( rtems_chain_node *after_node, rtems_chain_node *the_node ) { _Chain_Insert( after_node, the_node ); 2006ed0: f0 00 60 04 ld [ %g1 + 4 ], %i0 2006ed4: b2 10 00 02 mov %g2, %i1 2006ed8: 40 00 09 33 call 20093a4 <_Chain_Insert> 2006edc: 81 e8 00 00 restore =============================================================================== 02006bf8 : */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2006bf8: 05 00 80 62 sethi %hi(0x2018800), %g2 * NONE */ void rtems_aio_move_to_work (rtems_aio_request_chain *r_chain) { 2006bfc: 92 10 00 08 mov %o0, %o1 2006c00: 84 10 a3 2c or %g2, 0x32c, %g2 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 && 2006c04: c6 02 20 14 ld [ %o0 + 0x14 ], %g3 { rtems_aio_request_chain *temp; rtems_chain_node *node; node = rtems_chain_first (&aio_request_queue.work_req); temp = (rtems_aio_request_chain *) node; 2006c08: c2 00 a0 48 ld [ %g2 + 0x48 ], %g1 2006c0c: 84 00 a0 4c add %g2, 0x4c, %g2 while (temp->fildes < r_chain->fildes && 2006c10: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 2006c14: 80 a1 00 03 cmp %g4, %g3 2006c18: 16 80 00 04 bge 2006c28 2006c1c: 80 a0 40 02 cmp %g1, %g2 2006c20: 32 bf ff fc bne,a 2006c10 <== ALWAYS TAKEN 2006c24: c2 00 40 00 ld [ %g1 ], %g1 2006c28: d0 00 60 04 ld [ %g1 + 4 ], %o0 2006c2c: 82 13 c0 00 mov %o7, %g1 2006c30: 40 00 09 dd call 20093a4 <_Chain_Insert> 2006c34: 9e 10 40 00 mov %g1, %o7 =============================================================================== 02006f30 : * 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) { 2006f30: 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; 2006f34: 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 ); 2006f38: 82 06 20 04 add %i0, 4, %g1 if (rtems_chain_is_empty (chain)) 2006f3c: 80 a7 40 01 cmp %i5, %g1 2006f40: 12 80 00 05 bne 2006f54 2006f44: b0 10 20 02 mov 2, %i0 2006f48: 81 c7 e0 08 ret 2006f4c: 81 e8 00 00 restore 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) { 2006f50: 80 a7 40 01 cmp %i5, %g1 <== NOT EXECUTED 2006f54: 02 80 00 12 be 2006f9c <== NEVER TAKEN 2006f58: 01 00 00 00 nop 2006f5c: c4 07 60 14 ld [ %i5 + 0x14 ], %g2 2006f60: 80 a0 80 19 cmp %g2, %i1 2006f64: 32 bf ff fb bne,a 2006f50 <== NEVER TAKEN 2006f68: fa 07 40 00 ld [ %i5 ], %i5 <== NOT EXECUTED 2006f6c: 40 00 08 f6 call 2009344 <_Chain_Extract> 2006f70: 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; 2006f74: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2006f78: 84 10 20 8c mov 0x8c, %g2 2006f7c: c4 20 60 34 st %g2, [ %g1 + 0x34 ] current->aiocbp->return_value = -1; 2006f80: 84 10 3f ff mov -1, %g2 free (current); 2006f84: 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; 2006f88: c4 20 60 38 st %g2, [ %g1 + 0x38 ] free (current); 2006f8c: 7f ff f1 7f call 2003588 2006f90: b0 10 20 00 clr %i0 } return AIO_CANCELED; 2006f94: 81 c7 e0 08 ret 2006f98: 81 e8 00 00 restore } 2006f9c: 81 c7 e0 08 ret <== NOT EXECUTED 2006fa0: 91 e8 20 01 restore %g0, 1, %o0 <== NOT EXECUTED =============================================================================== 02006d20 : rtems_chain_control *chain, rtems_event_set events, rtems_interval timeout, rtems_chain_node **node_ptr ) { 2006d20: 9d e3 bf 98 save %sp, -104, %sp 2006d24: 10 80 00 09 b 2006d48 2006d28: ba 10 00 18 mov %i0, %i5 while ( sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL ) { rtems_event_set out; sc = rtems_event_receive( 2006d2c: 92 10 20 00 clr %o1 2006d30: 94 10 00 1a mov %i2, %o2 2006d34: 7f ff fd 03 call 2006140 2006d38: 96 07 bf fc add %fp, -4, %o3 ) { rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( 2006d3c: 80 a2 20 00 cmp %o0, 0 2006d40: 32 80 00 09 bne,a 2006d64 <== ALWAYS TAKEN 2006d44: f8 26 c0 00 st %i4, [ %i3 ] */ RTEMS_INLINE_ROUTINE rtems_chain_node *rtems_chain_get( rtems_chain_control *the_chain ) { return _Chain_Get( the_chain ); 2006d48: 40 00 01 7e call 2007340 <_Chain_Get> 2006d4c: 90 10 00 1d mov %i5, %o0 sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL 2006d50: b8 92 20 00 orcc %o0, 0, %i4 2006d54: 02 bf ff f6 be 2006d2c 2006d58: 90 10 00 19 mov %i1, %o0 2006d5c: 90 10 20 00 clr %o0 timeout, &out ); } *node_ptr = node; 2006d60: f8 26 c0 00 st %i4, [ %i3 ] return sc; } 2006d64: 81 c7 e0 08 ret 2006d68: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02009078 : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 2009078: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 200907c: 80 a6 20 00 cmp %i0, 0 2009080: 02 80 00 1b be 20090ec <== NEVER TAKEN 2009084: ba 10 20 01 mov 1, %i5 #if !defined(RTEMS_POSIX_API) || defined(RTEMS_DEBUG) if ( !_Objects_Information_table[ api_index ] ) continue; #endif information = _Objects_Information_table[ api_index ][ 1 ]; 2009088: 35 00 80 7d sethi %hi(0x201f400), %i2 #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 200908c: 83 2f 60 02 sll %i5, 2, %g1 #if !defined(RTEMS_POSIX_API) || defined(RTEMS_DEBUG) if ( !_Objects_Information_table[ api_index ] ) continue; #endif information = _Objects_Information_table[ api_index ][ 1 ]; 2009090: 84 16 a1 58 or %i2, 0x158, %g2 2009094: c2 00 80 01 ld [ %g2 + %g1 ], %g1 2009098: f6 00 60 04 ld [ %g1 + 4 ], %i3 if ( !information ) 200909c: 80 a6 e0 00 cmp %i3, 0 20090a0: 12 80 00 0b bne 20090cc 20090a4: b8 10 20 01 mov 1, %i4 Objects_Information *information; if ( !routine ) return; for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) { 20090a8: 10 80 00 0e b 20090e0 20090ac: ba 07 60 01 inc %i5 information = _Objects_Information_table[ api_index ][ 1 ]; if ( !information ) continue; for ( i=1 ; i <= information->maximum ; i++ ) { the_thread = (Thread_Control *)information->local_table[ i ]; 20090b0: 83 2f 20 02 sll %i4, 2, %g1 20090b4: d0 00 80 01 ld [ %g2 + %g1 ], %o0 if ( !the_thread ) 20090b8: 80 a2 20 00 cmp %o0, 0 20090bc: 02 80 00 04 be 20090cc 20090c0: b8 07 20 01 inc %i4 continue; (*routine)(the_thread); 20090c4: 9f c6 00 00 call %i0 20090c8: 01 00 00 00 nop information = _Objects_Information_table[ api_index ][ 1 ]; if ( !information ) continue; for ( i=1 ; i <= information->maximum ; i++ ) { 20090cc: c2 16 e0 10 lduh [ %i3 + 0x10 ], %g1 20090d0: 80 a7 00 01 cmp %i4, %g1 20090d4: 28 bf ff f7 bleu,a 20090b0 20090d8: c4 06 e0 1c ld [ %i3 + 0x1c ], %g2 Objects_Information *information; if ( !routine ) return; for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) { 20090dc: ba 07 60 01 inc %i5 20090e0: 80 a7 60 04 cmp %i5, 4 20090e4: 12 bf ff eb bne 2009090 20090e8: 83 2f 60 02 sll %i5, 2, %g1 20090ec: 81 c7 e0 08 ret 20090f0: 81 e8 00 00 restore =============================================================================== 02014b6c : uint32_t length, uint32_t buffer_size, rtems_attribute attribute_set, rtems_id *id ) { 2014b6c: 9d e3 bf a0 save %sp, -96, %sp register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) 2014b70: 80 a6 20 00 cmp %i0, 0 2014b74: 02 80 00 39 be 2014c58 2014b78: 82 10 20 03 mov 3, %g1 return RTEMS_INVALID_NAME; if ( !starting_address ) 2014b7c: 80 a6 60 00 cmp %i1, 0 2014b80: 02 80 00 36 be 2014c58 2014b84: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !id ) 2014b88: 80 a7 60 00 cmp %i5, 0 2014b8c: 02 80 00 33 be 2014c58 <== NEVER TAKEN 2014b90: 80 a6 e0 00 cmp %i3, 0 return RTEMS_INVALID_ADDRESS; if ( length == 0 || buffer_size == 0 || length < buffer_size || 2014b94: 02 80 00 31 be 2014c58 2014b98: 82 10 20 08 mov 8, %g1 2014b9c: 80 a6 a0 00 cmp %i2, 0 2014ba0: 02 80 00 2e be 2014c58 2014ba4: 80 a6 80 1b cmp %i2, %i3 2014ba8: 0a 80 00 2c bcs 2014c58 2014bac: 80 8e e0 07 btst 7, %i3 2014bb0: 12 80 00 2a bne 2014c58 2014bb4: 80 8e 60 07 btst 7, %i1 !_Partition_Is_buffer_size_aligned( buffer_size ) ) return RTEMS_INVALID_SIZE; if ( !_Addresses_Is_aligned( starting_address ) ) 2014bb8: 12 80 00 28 bne 2014c58 2014bbc: 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++; 2014bc0: 03 00 80 ed sethi %hi(0x203b400), %g1 2014bc4: c4 00 63 20 ld [ %g1 + 0x320 ], %g2 ! 203b720 <_Thread_Dispatch_disable_level> 2014bc8: 84 00 a0 01 inc %g2 2014bcc: c4 20 63 20 st %g2, [ %g1 + 0x320 ] return _Thread_Dispatch_disable_level; 2014bd0: c2 00 63 20 ld [ %g1 + 0x320 ], %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 ); 2014bd4: 23 00 80 ed sethi %hi(0x203b400), %l1 2014bd8: 40 00 12 77 call 20195b4 <_Objects_Allocate> 2014bdc: 90 14 61 34 or %l1, 0x134, %o0 ! 203b534 <_Partition_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { 2014be0: a0 92 20 00 orcc %o0, 0, %l0 2014be4: 32 80 00 06 bne,a 2014bfc 2014be8: f8 24 20 1c st %i4, [ %l0 + 0x1c ] _Thread_Enable_dispatch(); 2014bec: 40 00 17 79 call 201a9d0 <_Thread_Enable_dispatch> 2014bf0: 01 00 00 00 nop return RTEMS_TOO_MANY; 2014bf4: 10 80 00 19 b 2014c58 2014bf8: 82 10 20 05 mov 5, %g1 ! 5 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, length / buffer_size, buffer_size ); 2014bfc: 92 10 00 1b mov %i3, %o1 _Thread_Enable_dispatch(); return RTEMS_TOO_MANY; } #endif the_partition->starting_address = starting_address; 2014c00: f2 24 20 10 st %i1, [ %l0 + 0x10 ] the_partition->length = length; 2014c04: f4 24 20 14 st %i2, [ %l0 + 0x14 ] the_partition->buffer_size = buffer_size; 2014c08: f6 24 20 18 st %i3, [ %l0 + 0x18 ] the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; 2014c0c: c0 24 20 20 clr [ %l0 + 0x20 ] _Chain_Initialize( &the_partition->Memory, starting_address, length / buffer_size, buffer_size ); 2014c10: 40 00 58 f0 call 202afd0 <.udiv> 2014c14: 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, 2014c18: 92 10 00 19 mov %i1, %o1 length / buffer_size, buffer_size ); 2014c1c: 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, 2014c20: 96 10 00 1b mov %i3, %o3 2014c24: b8 04 20 24 add %l0, 0x24, %i4 2014c28: 40 00 0c 6a call 2017dd0 <_Chain_Initialize> 2014c2c: 90 10 00 1c mov %i4, %o0 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2014c30: c4 14 20 0a lduh [ %l0 + 0xa ], %g2 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 2014c34: a2 14 61 34 or %l1, 0x134, %l1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2014c38: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2014c3c: c2 04 20 08 ld [ %l0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2014c40: 85 28 a0 02 sll %g2, 2, %g2 2014c44: e0 20 c0 02 st %l0, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2014c48: f0 24 20 0c st %i0, [ %l0 + 0xc ] name, 0 /* Not used */ ); #endif _Thread_Enable_dispatch(); 2014c4c: 40 00 17 61 call 201a9d0 <_Thread_Enable_dispatch> 2014c50: c2 27 40 00 st %g1, [ %i5 ] return RTEMS_SUCCESSFUL; 2014c54: 82 10 20 00 clr %g1 } 2014c58: 81 c7 e0 08 ret 2014c5c: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 02007258 : rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 2007258: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Rate_monotonic_Control *_Rate_monotonic_Get ( Objects_Id id, Objects_Locations *location ) { return (Rate_monotonic_Control *) 200725c: 11 00 80 79 sethi %hi(0x201e400), %o0 2007260: 92 10 00 18 mov %i0, %o1 2007264: 90 12 23 f4 or %o0, 0x3f4, %o0 2007268: 40 00 08 ff call 2009664 <_Objects_Get> 200726c: 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 ) { 2007270: c2 07 bf fc ld [ %fp + -4 ], %g1 2007274: 80 a0 60 00 cmp %g1, 0 2007278: 12 80 00 65 bne 200740c 200727c: ba 10 00 08 mov %o0, %i5 RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 2007280: 37 00 80 7b sethi %hi(0x201ec00), %i3 case OBJECTS_LOCAL: if ( !_Thread_Is_executing( the_period->owner ) ) { 2007284: c4 02 20 40 ld [ %o0 + 0x40 ], %g2 2007288: b6 16 e2 98 or %i3, 0x298, %i3 200728c: c2 06 e0 0c ld [ %i3 + 0xc ], %g1 2007290: 80 a0 80 01 cmp %g2, %g1 2007294: 02 80 00 06 be 20072ac 2007298: 80 a6 60 00 cmp %i1, 0 _Thread_Enable_dispatch(); 200729c: 40 00 0c ae call 200a554 <_Thread_Enable_dispatch> 20072a0: b0 10 20 17 mov 0x17, %i0 return RTEMS_NOT_OWNER_OF_RESOURCE; 20072a4: 81 c7 e0 08 ret 20072a8: 81 e8 00 00 restore } if ( length == RTEMS_PERIOD_STATUS ) { 20072ac: 12 80 00 0d bne 20072e0 20072b0: 01 00 00 00 nop switch ( the_period->state ) { 20072b4: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 20072b8: 80 a0 60 04 cmp %g1, 4 20072bc: 18 80 00 05 bgu 20072d0 <== NEVER TAKEN 20072c0: b0 10 20 00 clr %i0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 20072c4: 05 00 80 71 sethi %hi(0x201c400), %g2 20072c8: 84 10 a1 f8 or %g2, 0x1f8, %g2 ! 201c5f8 20072cc: f0 08 80 01 ldub [ %g2 + %g1 ], %i0 case RATE_MONOTONIC_ACTIVE: default: /* unreached -- only to remove warnings */ return_value = RTEMS_SUCCESSFUL; break; } _Thread_Enable_dispatch(); 20072d0: 40 00 0c a1 call 200a554 <_Thread_Enable_dispatch> 20072d4: 01 00 00 00 nop return( return_value ); 20072d8: 81 c7 e0 08 ret 20072dc: 81 e8 00 00 restore } _ISR_Disable( level ); 20072e0: 7f ff ee ef call 2002e9c 20072e4: 01 00 00 00 nop 20072e8: b4 10 00 08 mov %o0, %i2 if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { 20072ec: f8 07 60 38 ld [ %i5 + 0x38 ], %i4 20072f0: 80 a7 20 00 cmp %i4, 0 20072f4: 12 80 00 15 bne 2007348 20072f8: 80 a7 20 02 cmp %i4, 2 _ISR_Enable( level ); 20072fc: 7f ff ee ec call 2002eac 2007300: 01 00 00 00 nop /* * Baseline statistics information for the beginning of a period. */ _Rate_monotonic_Initiate_statistics( the_period ); 2007304: 7f ff ff 7f call 2007100 <_Rate_monotonic_Initiate_statistics> 2007308: 90 10 00 1d mov %i5, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 200730c: 82 10 20 02 mov 2, %g1 2007310: c2 27 60 38 st %g1, [ %i5 + 0x38 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2007314: 03 00 80 1d sethi %hi(0x2007400), %g1 2007318: 82 10 62 c8 or %g1, 0x2c8, %g1 ! 20076c8 <_Rate_monotonic_Timeout> Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 200731c: c0 27 60 18 clr [ %i5 + 0x18 ] the_watchdog->routine = routine; 2007320: c2 27 60 2c st %g1, [ %i5 + 0x2c ] the_watchdog->id = id; 2007324: f0 27 60 30 st %i0, [ %i5 + 0x30 ] the_watchdog->user_data = user_data; 2007328: c0 27 60 34 clr [ %i5 + 0x34 ] _Rate_monotonic_Timeout, id, NULL ); the_period->next_length = length; 200732c: f2 27 60 3c st %i1, [ %i5 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007330: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007334: 11 00 80 7a sethi %hi(0x201e800), %o0 2007338: 92 07 60 10 add %i5, 0x10, %o1 200733c: 40 00 10 5e call 200b4b4 <_Watchdog_Insert> 2007340: 90 12 22 1c or %o0, 0x21c, %o0 2007344: 30 80 00 1b b,a 20073b0 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { 2007348: 12 80 00 1e bne 20073c0 200734c: 80 a7 20 04 cmp %i4, 4 /* * Update statistics from the concluding period. */ _Rate_monotonic_Update_statistics( the_period ); 2007350: 7f ff ff 86 call 2007168 <_Rate_monotonic_Update_statistics> 2007354: 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; 2007358: 82 10 20 01 mov 1, %g1 the_period->next_length = length; 200735c: 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; 2007360: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; _ISR_Enable( level ); 2007364: 7f ff ee d2 call 2002eac 2007368: 90 10 00 1a mov %i2, %o0 _Thread_Executing->Wait.id = the_period->Object.id; 200736c: d0 06 e0 0c ld [ %i3 + 0xc ], %o0 2007370: c2 07 60 08 ld [ %i5 + 8 ], %g1 _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 2007374: 13 00 00 10 sethi %hi(0x4000), %o1 2007378: 40 00 0e a6 call 200ae10 <_Thread_Set_state> 200737c: c2 22 20 20 st %g1, [ %o0 + 0x20 ] /* * Did the watchdog timer expire while we were actually blocking * on it? */ _ISR_Disable( level ); 2007380: 7f ff ee c7 call 2002e9c 2007384: 01 00 00 00 nop local_state = the_period->state; 2007388: f4 07 60 38 ld [ %i5 + 0x38 ], %i2 the_period->state = RATE_MONOTONIC_ACTIVE; 200738c: f8 27 60 38 st %i4, [ %i5 + 0x38 ] _ISR_Enable( level ); 2007390: 7f ff ee c7 call 2002eac 2007394: 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 ) 2007398: 80 a6 a0 03 cmp %i2, 3 200739c: 12 80 00 05 bne 20073b0 20073a0: 01 00 00 00 nop _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 20073a4: d0 06 e0 0c ld [ %i3 + 0xc ], %o0 20073a8: 40 00 0b 8d call 200a1dc <_Thread_Clear_state> 20073ac: 13 00 00 10 sethi %hi(0x4000), %o1 _Thread_Enable_dispatch(); 20073b0: 40 00 0c 69 call 200a554 <_Thread_Enable_dispatch> 20073b4: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 20073b8: 81 c7 e0 08 ret 20073bc: 81 e8 00 00 restore } if ( the_period->state == RATE_MONOTONIC_EXPIRED ) { 20073c0: 12 bf ff b9 bne 20072a4 <== NEVER TAKEN 20073c4: b0 10 20 04 mov 4, %i0 /* * Update statistics from the concluding period */ _Rate_monotonic_Update_statistics( the_period ); 20073c8: 7f ff ff 68 call 2007168 <_Rate_monotonic_Update_statistics> 20073cc: 90 10 00 1d mov %i5, %o0 _ISR_Enable( level ); 20073d0: 7f ff ee b7 call 2002eac 20073d4: 90 10 00 1a mov %i2, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 20073d8: 82 10 20 02 mov 2, %g1 20073dc: 92 07 60 10 add %i5, 0x10, %o1 20073e0: 11 00 80 7a sethi %hi(0x201e800), %o0 20073e4: 90 12 22 1c or %o0, 0x21c, %o0 ! 201ea1c <_Watchdog_Ticks_chain> 20073e8: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; 20073ec: f2 27 60 3c st %i1, [ %i5 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20073f0: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20073f4: 40 00 10 30 call 200b4b4 <_Watchdog_Insert> 20073f8: b0 10 20 06 mov 6, %i0 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 20073fc: 40 00 0c 56 call 200a554 <_Thread_Enable_dispatch> 2007400: 01 00 00 00 nop return RTEMS_TIMEOUT; 2007404: 81 c7 e0 08 ret 2007408: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 200740c: b0 10 20 04 mov 4, %i0 } 2007410: 81 c7 e0 08 ret 2007414: 81 e8 00 00 restore =============================================================================== 02007418 : */ void rtems_rate_monotonic_report_statistics_with_plugin( void *context, rtems_printk_plugin_t print ) { 2007418: 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 ) 200741c: 80 a6 60 00 cmp %i1, 0 2007420: 02 80 00 75 be 20075f4 <== NEVER TAKEN 2007424: 90 10 00 18 mov %i0, %o0 return; (*print)( context, "Period information by period\n" ); 2007428: 13 00 80 71 sethi %hi(0x201c400), %o1 200742c: 9f c6 40 00 call %i1 2007430: 92 12 62 00 or %o1, 0x200, %o1 ! 201c600 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ (*print)( context, "--- CPU times are in seconds ---\n" ); 2007434: 90 10 00 18 mov %i0, %o0 2007438: 13 00 80 71 sethi %hi(0x201c400), %o1 200743c: 9f c6 40 00 call %i1 2007440: 92 12 62 20 or %o1, 0x220, %o1 ! 201c620 (*print)( context, "--- Wall times are in seconds ---\n" ); 2007444: 90 10 00 18 mov %i0, %o0 2007448: 13 00 80 71 sethi %hi(0x201c400), %o1 200744c: 9f c6 40 00 call %i1 2007450: 92 12 62 48 or %o1, 0x248, %o1 ! 201c648 Be sure to test the various cases. (*print)( context,"\ 1234567890123456789012345678901234567890123456789012345678901234567890123456789\ \n"); */ (*print)( context, " ID OWNER COUNT MISSED " 2007454: 90 10 00 18 mov %i0, %o0 2007458: 13 00 80 71 sethi %hi(0x201c400), %o1 200745c: 9f c6 40 00 call %i1 2007460: 92 12 62 70 or %o1, 0x270, %o1 ! 201c670 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ " " #endif " WALL TIME\n" ); (*print)( context, " " 2007464: 90 10 00 18 mov %i0, %o0 2007468: 13 00 80 71 sethi %hi(0x201c400), %o1 200746c: 9f c6 40 00 call %i1 2007470: 92 12 62 c0 or %o1, 0x2c0, %o1 ! 201c6c0 /* * 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 ; 2007474: 03 00 80 79 sethi %hi(0x201e400), %g1 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 2007478: 21 00 80 71 sethi %hi(0x201c400), %l0 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, 200747c: 35 00 80 71 sethi %hi(0x201c400), %i2 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, 2007480: 37 00 80 71 sethi %hi(0x201c400), %i3 /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { (*print)( context, "\n" ); 2007484: 39 00 80 6e sethi %hi(0x201b800), %i4 /* * 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 ; 2007488: fa 00 63 fc ld [ %g1 + 0x3fc ], %i5 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 200748c: a0 14 23 10 or %l0, 0x310, %l0 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, 2007490: b4 16 a3 28 or %i2, 0x328, %i2 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, 2007494: b6 16 e3 48 or %i3, 0x348, %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 ; 2007498: 10 80 00 52 b 20075e0 200749c: b8 17 20 88 or %i4, 0x88, %i4 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 20074a0: 40 00 19 d3 call 200dbec 20074a4: 92 07 bf a0 add %fp, -96, %o1 if ( status != RTEMS_SUCCESSFUL ) 20074a8: 80 a2 20 00 cmp %o0, 0 20074ac: 32 80 00 4d bne,a 20075e0 20074b0: ba 07 60 01 inc %i5 #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 ); 20074b4: 92 07 bf d8 add %fp, -40, %o1 20074b8: 40 00 19 fa call 200dca0 20074bc: 90 10 00 1d mov %i5, %o0 #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 20074c0: d0 07 bf d8 ld [ %fp + -40 ], %o0 20074c4: 92 10 20 05 mov 5, %o1 20074c8: 40 00 00 af call 2007784 20074cc: 94 07 bf f8 add %fp, -8, %o2 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 20074d0: d8 1f bf a0 ldd [ %fp + -96 ], %o4 20074d4: 92 10 00 10 mov %l0, %o1 20074d8: 90 10 00 18 mov %i0, %o0 20074dc: 94 10 00 1d mov %i5, %o2 20074e0: 9f c6 40 00 call %i1 20074e4: 96 07 bf f8 add %fp, -8, %o3 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 20074e8: d2 07 bf a0 ld [ %fp + -96 ], %o1 20074ec: 80 a2 60 00 cmp %o1, 0 20074f0: 12 80 00 07 bne 200750c 20074f4: 94 07 bf f0 add %fp, -16, %o2 (*print)( context, "\n" ); 20074f8: 90 10 00 18 mov %i0, %o0 20074fc: 9f c6 40 00 call %i1 2007500: 92 10 00 1c mov %i4, %o1 continue; 2007504: 10 80 00 37 b 20075e0 2007508: ba 07 60 01 inc %i5 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 ); 200750c: 40 00 0e cb call 200b038 <_Timespec_Divide_by_integer> 2007510: 90 07 bf b8 add %fp, -72, %o0 (*print)( context, 2007514: d0 07 bf ac ld [ %fp + -84 ], %o0 2007518: 40 00 47 57 call 2019274 <.div> 200751c: 92 10 23 e8 mov 0x3e8, %o1 2007520: a6 10 00 08 mov %o0, %l3 2007524: d0 07 bf b4 ld [ %fp + -76 ], %o0 2007528: 40 00 47 53 call 2019274 <.div> 200752c: 92 10 23 e8 mov 0x3e8, %o1 2007530: c2 07 bf f0 ld [ %fp + -16 ], %g1 2007534: a2 10 00 08 mov %o0, %l1 2007538: d0 07 bf f4 ld [ %fp + -12 ], %o0 200753c: e8 07 bf a8 ld [ %fp + -88 ], %l4 2007540: e4 07 bf b0 ld [ %fp + -80 ], %l2 2007544: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2007548: 40 00 47 4b call 2019274 <.div> 200754c: 92 10 23 e8 mov 0x3e8, %o1 2007550: 96 10 00 13 mov %l3, %o3 2007554: 98 10 00 12 mov %l2, %o4 2007558: 9a 10 00 11 mov %l1, %o5 200755c: 94 10 00 14 mov %l4, %o2 2007560: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 2007564: 92 10 00 1a mov %i2, %o1 2007568: 9f c6 40 00 call %i1 200756c: 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); 2007570: d2 07 bf a0 ld [ %fp + -96 ], %o1 2007574: 94 07 bf f0 add %fp, -16, %o2 2007578: 40 00 0e b0 call 200b038 <_Timespec_Divide_by_integer> 200757c: 90 07 bf d0 add %fp, -48, %o0 (*print)( context, 2007580: d0 07 bf c4 ld [ %fp + -60 ], %o0 2007584: 40 00 47 3c call 2019274 <.div> 2007588: 92 10 23 e8 mov 0x3e8, %o1 200758c: a6 10 00 08 mov %o0, %l3 2007590: d0 07 bf cc ld [ %fp + -52 ], %o0 2007594: 40 00 47 38 call 2019274 <.div> 2007598: 92 10 23 e8 mov 0x3e8, %o1 200759c: c2 07 bf f0 ld [ %fp + -16 ], %g1 20075a0: a2 10 00 08 mov %o0, %l1 20075a4: d0 07 bf f4 ld [ %fp + -12 ], %o0 20075a8: e8 07 bf c0 ld [ %fp + -64 ], %l4 20075ac: e4 07 bf c8 ld [ %fp + -56 ], %l2 20075b0: 92 10 23 e8 mov 0x3e8, %o1 20075b4: 40 00 47 30 call 2019274 <.div> 20075b8: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 20075bc: 92 10 00 1b mov %i3, %o1 20075c0: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 20075c4: 94 10 00 14 mov %l4, %o2 20075c8: 90 10 00 18 mov %i0, %o0 20075cc: 96 10 00 13 mov %l3, %o3 20075d0: 98 10 00 12 mov %l2, %o4 20075d4: 9f c6 40 00 call %i1 20075d8: 9a 10 00 11 mov %l1, %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 ; id <= _Rate_monotonic_Information.maximum_id ; id++ ) { 20075dc: 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 ; id <= _Rate_monotonic_Information.maximum_id ; 20075e0: 03 00 80 7a sethi %hi(0x201e800), %g1 /* * 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 ; 20075e4: c2 00 60 00 ld [ %g1 ], %g1 20075e8: 80 a7 40 01 cmp %i5, %g1 20075ec: 08 bf ff ad bleu 20074a0 20075f0: 90 10 00 1d mov %i5, %o0 20075f4: 81 c7 e0 08 ret 20075f8: 81 e8 00 00 restore =============================================================================== 020160dc : rtems_status_code rtems_signal_send( rtems_id id, rtems_signal_set signal_set ) { 20160dc: 9d e3 bf 98 save %sp, -104, %sp 20160e0: 90 10 00 18 mov %i0, %o0 register Thread_Control *the_thread; Objects_Locations location; RTEMS_API_Control *api; ASR_Information *asr; if ( !signal_set ) 20160e4: 80 a6 60 00 cmp %i1, 0 20160e8: 02 80 00 2e be 20161a0 20160ec: b0 10 20 0a mov 0xa, %i0 return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 20160f0: 40 00 12 45 call 201aa04 <_Thread_Get> 20160f4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20160f8: c2 07 bf fc ld [ %fp + -4 ], %g1 ASR_Information *asr; if ( !signal_set ) return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 20160fc: b8 10 00 08 mov %o0, %i4 switch ( location ) { 2016100: 80 a0 60 00 cmp %g1, 0 2016104: 12 80 00 27 bne 20161a0 2016108: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 201610c: fa 02 21 58 ld [ %o0 + 0x158 ], %i5 asr = &api->Signal; if ( ! _ASR_Is_null_handler( asr->handler ) ) { 2016110: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2016114: 80 a0 60 00 cmp %g1, 0 2016118: 02 80 00 24 be 20161a8 201611c: 01 00 00 00 nop if ( asr->is_enabled ) { 2016120: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 2016124: 80 a0 60 00 cmp %g1, 0 2016128: 02 80 00 15 be 201617c 201612c: 01 00 00 00 nop rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 2016130: 7f ff e7 e4 call 20100c0 2016134: 01 00 00 00 nop *signal_set |= signals; 2016138: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 201613c: b2 10 40 19 or %g1, %i1, %i1 2016140: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _ISR_Enable( _level ); 2016144: 7f ff e7 e3 call 20100d0 2016148: 01 00 00 00 nop _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 201614c: 03 00 80 ef sethi %hi(0x203bc00), %g1 2016150: 82 10 60 60 or %g1, 0x60, %g1 ! 203bc60 <_Per_CPU_Information> 2016154: c4 00 60 08 ld [ %g1 + 8 ], %g2 2016158: 80 a0 a0 00 cmp %g2, 0 201615c: 02 80 00 0f be 2016198 2016160: 01 00 00 00 nop 2016164: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2016168: 80 a7 00 02 cmp %i4, %g2 201616c: 12 80 00 0b bne 2016198 <== NEVER TAKEN 2016170: 84 10 20 01 mov 1, %g2 _Thread_Dispatch_necessary = true; 2016174: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 2016178: 30 80 00 08 b,a 2016198 rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 201617c: 7f ff e7 d1 call 20100c0 2016180: 01 00 00 00 nop *signal_set |= signals; 2016184: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 2016188: b2 10 40 19 or %g1, %i1, %i1 201618c: f2 27 60 18 st %i1, [ %i5 + 0x18 ] _ISR_Enable( _level ); 2016190: 7f ff e7 d0 call 20100d0 2016194: 01 00 00 00 nop } else { _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); 2016198: 40 00 12 0e call 201a9d0 <_Thread_Enable_dispatch> 201619c: b0 10 20 00 clr %i0 ! 0 return RTEMS_SUCCESSFUL; 20161a0: 81 c7 e0 08 ret 20161a4: 81 e8 00 00 restore } _Thread_Enable_dispatch(); 20161a8: 40 00 12 0a call 201a9d0 <_Thread_Enable_dispatch> 20161ac: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; 20161b0: 81 c7 e0 08 ret 20161b4: 81 e8 00 00 restore =============================================================================== 0200e558 : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { 200e558: 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 ) 200e55c: 80 a6 a0 00 cmp %i2, 0 200e560: 02 80 00 5a be 200e6c8 200e564: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; 200e568: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e56c: f8 00 63 f4 ld [ %g1 + 0x3f4 ], %i4 ! 201cff4 <_Per_CPU_Information+0xc> api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200e570: c2 0f 20 74 ldub [ %i4 + 0x74 ], %g1 if ( !previous_mode_set ) return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; 200e574: fa 07 21 58 ld [ %i4 + 0x158 ], %i5 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200e578: 80 a0 00 01 cmp %g0, %g1 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200e57c: c2 07 20 7c ld [ %i4 + 0x7c ], %g1 executing = _Thread_Executing; api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200e580: b6 60 3f ff subx %g0, -1, %i3 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200e584: 80 a0 60 00 cmp %g1, 0 200e588: 02 80 00 03 be 200e594 200e58c: b7 2e e0 08 sll %i3, 8, %i3 old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; 200e590: b6 16 e2 00 or %i3, 0x200, %i3 old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 200e594: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 200e598: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 200e59c: 7f ff ee c4 call 200a0ac <_CPU_ISR_Get_level> 200e5a0: a0 60 3f ff subx %g0, -1, %l0 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; 200e5a4: a1 2c 20 0a sll %l0, 0xa, %l0 200e5a8: a0 14 00 08 or %l0, %o0, %l0 old_mode |= _ISR_Get_level(); 200e5ac: b6 14 00 1b or %l0, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 200e5b0: 80 8e 61 00 btst 0x100, %i1 200e5b4: 02 80 00 06 be 200e5cc 200e5b8: 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; 200e5bc: 82 0e 21 00 and %i0, 0x100, %g1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; 200e5c0: 80 a0 00 01 cmp %g0, %g1 200e5c4: 82 60 3f ff subx %g0, -1, %g1 200e5c8: c2 2f 20 74 stb %g1, [ %i4 + 0x74 ] if ( mask & RTEMS_TIMESLICE_MASK ) { 200e5cc: 80 8e 62 00 btst 0x200, %i1 200e5d0: 02 80 00 0b be 200e5fc 200e5d4: 80 8e 60 0f btst 0xf, %i1 if ( _Modes_Is_timeslice(mode_set) ) { 200e5d8: 80 8e 22 00 btst 0x200, %i0 200e5dc: 22 80 00 07 be,a 200e5f8 200e5e0: c0 27 20 7c clr [ %i4 + 0x7c ] executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 200e5e4: 82 10 20 01 mov 1, %g1 200e5e8: c2 27 20 7c st %g1, [ %i4 + 0x7c ] executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 200e5ec: 03 00 80 72 sethi %hi(0x201c800), %g1 200e5f0: c2 00 62 14 ld [ %g1 + 0x214 ], %g1 ! 201ca14 <_Thread_Ticks_per_timeslice> 200e5f4: c2 27 20 78 st %g1, [ %i4 + 0x78 ] } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200e5f8: 80 8e 60 0f btst 0xf, %i1 200e5fc: 02 80 00 06 be 200e614 200e600: 80 8e 64 00 btst 0x400, %i1 */ RTEMS_INLINE_ROUTINE ISR_Level _Modes_Get_interrupt_level ( Modes_Control mode_set ) { return ( mode_set & RTEMS_INTERRUPT_MASK ); 200e604: 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 ) ); 200e608: 7f ff ce e1 call 200218c 200e60c: 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 ) { 200e610: 80 8e 64 00 btst 0x400, %i1 200e614: 02 80 00 14 be 200e664 200e618: 88 10 20 00 clr %g4 is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 200e61c: c4 0f 60 08 ldub [ %i5 + 8 ], %g2 */ RTEMS_INLINE_ROUTINE bool _Modes_Is_asr_disabled ( Modes_Control mode_set ) { return (mode_set & RTEMS_ASR_MASK) == RTEMS_NO_ASR; 200e620: 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( 200e624: 80 a0 00 18 cmp %g0, %i0 200e628: 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 ) { 200e62c: 80 a0 40 02 cmp %g1, %g2 200e630: 22 80 00 0e be,a 200e668 200e634: 03 00 80 73 sethi %hi(0x201cc00), %g1 ) { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); 200e638: 7f ff ce d1 call 200217c 200e63c: c2 2f 60 08 stb %g1, [ %i5 + 8 ] _signals = information->signals_pending; 200e640: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 information->signals_pending = information->signals_posted; 200e644: c4 07 60 14 ld [ %i5 + 0x14 ], %g2 information->signals_posted = _signals; 200e648: c2 27 60 14 st %g1, [ %i5 + 0x14 ] rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); _signals = information->signals_pending; information->signals_pending = information->signals_posted; 200e64c: c4 27 60 18 st %g2, [ %i5 + 0x18 ] information->signals_posted = _signals; _ISR_Enable( _level ); 200e650: 7f ff ce cf call 200218c 200e654: 01 00 00 00 nop asr->is_enabled = is_asr_enabled; _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { 200e658: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 /* * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; 200e65c: 80 a0 00 01 cmp %g0, %g1 200e660: 88 40 20 00 addx %g0, 0, %g4 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) { 200e664: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e668: c4 00 60 04 ld [ %g1 + 4 ], %g2 ! 201cc04 <_System_state_Current> 200e66c: 80 a0 a0 03 cmp %g2, 3 200e670: 12 80 00 16 bne 200e6c8 200e674: 82 10 20 00 clr %g1 bool are_signals_pending ) { Thread_Control *executing; executing = _Thread_Executing; 200e678: 07 00 80 73 sethi %hi(0x201cc00), %g3 if ( are_signals_pending || 200e67c: 80 89 20 ff btst 0xff, %g4 bool are_signals_pending ) { Thread_Control *executing; executing = _Thread_Executing; 200e680: 86 10 e3 e8 or %g3, 0x3e8, %g3 if ( are_signals_pending || 200e684: 12 80 00 0a bne 200e6ac 200e688: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 200e68c: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3 200e690: 80 a0 80 03 cmp %g2, %g3 200e694: 02 80 00 0d be 200e6c8 200e698: 01 00 00 00 nop (!_Thread_Is_heir( executing ) && executing->is_preemptible) ) { 200e69c: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 200e6a0: 80 a0 a0 00 cmp %g2, 0 200e6a4: 02 80 00 09 be 200e6c8 <== NEVER TAKEN 200e6a8: 01 00 00 00 nop _Thread_Dispatch_necessary = true; 200e6ac: 84 10 20 01 mov 1, %g2 ! 1 200e6b0: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e6b4: 82 10 63 e8 or %g1, 0x3e8, %g1 ! 201cfe8 <_Per_CPU_Information> 200e6b8: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); 200e6bc: 7f ff e9 3f call 2008bb8 <_Thread_Dispatch> 200e6c0: 01 00 00 00 nop } return RTEMS_SUCCESSFUL; 200e6c4: 82 10 20 00 clr %g1 ! 0 } 200e6c8: 81 c7 e0 08 ret 200e6cc: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200aa28 : rtems_status_code rtems_task_set_priority( rtems_id id, rtems_task_priority new_priority, rtems_task_priority *old_priority ) { 200aa28: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; if ( new_priority != RTEMS_CURRENT_PRIORITY && 200aa2c: 80 a6 60 00 cmp %i1, 0 200aa30: 02 80 00 07 be 200aa4c 200aa34: 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 ) ); 200aa38: 03 00 80 65 sethi %hi(0x2019400), %g1 200aa3c: c2 08 62 dc ldub [ %g1 + 0x2dc ], %g1 ! 20196dc 200aa40: 80 a6 40 01 cmp %i1, %g1 200aa44: 18 80 00 1c bgu 200aab4 200aa48: b0 10 20 13 mov 0x13, %i0 !_RTEMS_tasks_Priority_is_valid( new_priority ) ) return RTEMS_INVALID_PRIORITY; if ( !old_priority ) 200aa4c: 80 a6 a0 00 cmp %i2, 0 200aa50: 02 80 00 19 be 200aab4 200aa54: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get( id, &location ); 200aa58: 40 00 09 87 call 200d074 <_Thread_Get> 200aa5c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200aa60: c2 07 bf fc ld [ %fp + -4 ], %g1 200aa64: 80 a0 60 00 cmp %g1, 0 200aa68: 12 80 00 13 bne 200aab4 200aa6c: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* XXX need helper to "convert" from core priority */ *old_priority = the_thread->current_priority; 200aa70: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( new_priority != RTEMS_CURRENT_PRIORITY ) { 200aa74: 80 a6 60 00 cmp %i1, 0 200aa78: 02 80 00 0d be 200aaac 200aa7c: c2 26 80 00 st %g1, [ %i2 ] the_thread->real_priority = new_priority; if ( the_thread->resource_count == 0 || 200aa80: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 200aa84: 80 a0 60 00 cmp %g1, 0 200aa88: 02 80 00 06 be 200aaa0 200aa8c: f2 22 20 18 st %i1, [ %o0 + 0x18 ] 200aa90: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200aa94: 80 a0 40 19 cmp %g1, %i1 200aa98: 08 80 00 05 bleu 200aaac <== ALWAYS TAKEN 200aa9c: 01 00 00 00 nop the_thread->current_priority > new_priority ) _Thread_Change_priority( the_thread, new_priority, false ); 200aaa0: 92 10 00 19 mov %i1, %o1 200aaa4: 40 00 08 43 call 200cbb0 <_Thread_Change_priority> 200aaa8: 94 10 20 00 clr %o2 } _Thread_Enable_dispatch(); 200aaac: 40 00 09 65 call 200d040 <_Thread_Enable_dispatch> 200aab0: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 200aab4: 81 c7 e0 08 ret 200aab8: 81 e8 00 00 restore =============================================================================== 02016ae4 : */ rtems_status_code rtems_timer_cancel( rtems_id id ) { 2016ae4: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get ( Objects_Id id, Objects_Locations *location ) { return (Timer_Control *) 2016ae8: 11 00 80 f0 sethi %hi(0x203c000), %o0 2016aec: 92 10 00 18 mov %i0, %o1 2016af0: 90 12 20 a4 or %o0, 0xa4, %o0 2016af4: 40 00 0b fb call 2019ae0 <_Objects_Get> 2016af8: 94 07 bf fc add %fp, -4, %o2 Timer_Control *the_timer; Objects_Locations location; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2016afc: c2 07 bf fc ld [ %fp + -4 ], %g1 2016b00: 80 a0 60 00 cmp %g1, 0 2016b04: 12 80 00 0c bne 2016b34 2016b08: 01 00 00 00 nop case OBJECTS_LOCAL: if ( !_Timer_Is_dormant_class( the_timer->the_class ) ) 2016b0c: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2016b10: 80 a0 60 04 cmp %g1, 4 2016b14: 02 80 00 04 be 2016b24 <== NEVER TAKEN 2016b18: 01 00 00 00 nop (void) _Watchdog_Remove( &the_timer->Ticker ); 2016b1c: 40 00 14 2c call 201bbcc <_Watchdog_Remove> 2016b20: 90 02 20 10 add %o0, 0x10, %o0 _Thread_Enable_dispatch(); 2016b24: 40 00 0f ab call 201a9d0 <_Thread_Enable_dispatch> 2016b28: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2016b2c: 81 c7 e0 08 ret 2016b30: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2016b34: 81 c7 e0 08 ret 2016b38: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 02016fe0 : rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 2016fe0: 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; 2016fe4: 03 00 80 f0 sethi %hi(0x203c000), %g1 2016fe8: f8 00 60 e4 ld [ %g1 + 0xe4 ], %i4 ! 203c0e4 <_Timer_server> rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 2016fec: ba 10 00 18 mov %i0, %i5 Timer_Control *the_timer; Objects_Locations location; rtems_interval seconds; Timer_server_Control *timer_server = _Timer_server; if ( !timer_server ) 2016ff0: 80 a7 20 00 cmp %i4, 0 2016ff4: 02 80 00 32 be 20170bc 2016ff8: b0 10 20 0e mov 0xe, %i0 return RTEMS_INCORRECT_STATE; if ( !_TOD_Is_set ) 2016ffc: 03 00 80 ed sethi %hi(0x203b400), %g1 2017000: c2 08 63 30 ldub [ %g1 + 0x330 ], %g1 ! 203b730 <_TOD_Is_set> 2017004: 80 a0 60 00 cmp %g1, 0 2017008: 02 80 00 2d be 20170bc <== NEVER TAKEN 201700c: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; if ( !routine ) 2017010: 80 a6 a0 00 cmp %i2, 0 2017014: 02 80 00 2a be 20170bc 2017018: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) 201701c: 90 10 00 19 mov %i1, %o0 2017020: 7f ff f4 11 call 2014064 <_TOD_Validate> 2017024: b0 10 20 14 mov 0x14, %i0 2017028: 80 8a 20 ff btst 0xff, %o0 201702c: 02 80 00 27 be 20170c8 2017030: 01 00 00 00 nop return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 2017034: 7f ff f3 d8 call 2013f94 <_TOD_To_seconds> 2017038: 90 10 00 19 mov %i1, %o0 if ( seconds <= _TOD_Seconds_since_epoch() ) 201703c: 21 00 80 ed sethi %hi(0x203b400), %l0 2017040: c2 04 23 ac ld [ %l0 + 0x3ac ], %g1 ! 203b7ac <_TOD_Now> 2017044: 80 a2 00 01 cmp %o0, %g1 2017048: 08 80 00 1d bleu 20170bc 201704c: b2 10 00 08 mov %o0, %i1 2017050: 11 00 80 f0 sethi %hi(0x203c000), %o0 2017054: 92 10 00 1d mov %i5, %o1 2017058: 90 12 20 a4 or %o0, 0xa4, %o0 201705c: 40 00 0a a1 call 2019ae0 <_Objects_Get> 2017060: 94 07 bf fc add %fp, -4, %o2 return RTEMS_INVALID_CLOCK; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2017064: c2 07 bf fc ld [ %fp + -4 ], %g1 2017068: 80 a0 60 00 cmp %g1, 0 201706c: 12 80 00 16 bne 20170c4 2017070: b0 10 00 08 mov %o0, %i0 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); 2017074: 40 00 12 d6 call 201bbcc <_Watchdog_Remove> 2017078: 90 02 20 10 add %o0, 0x10, %o0 the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; 201707c: 82 10 20 03 mov 3, %g1 2017080: c2 26 20 38 st %g1, [ %i0 + 0x38 ] _Watchdog_Initialize( &the_timer->Ticker, routine, id, user_data ); the_timer->Ticker.initial = seconds - _TOD_Seconds_since_epoch(); 2017084: c2 04 23 ac ld [ %l0 + 0x3ac ], %g1 (*timer_server->schedule_operation)( timer_server, the_timer ); 2017088: 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(); 201708c: b2 26 40 01 sub %i1, %g1, %i1 (*timer_server->schedule_operation)( timer_server, the_timer ); 2017090: c2 07 20 04 ld [ %i4 + 4 ], %g1 2017094: 90 10 00 1c mov %i4, %o0 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2017098: c0 26 20 18 clr [ %i0 + 0x18 ] the_watchdog->routine = routine; 201709c: f4 26 20 2c st %i2, [ %i0 + 0x2c ] the_watchdog->id = id; 20170a0: fa 26 20 30 st %i5, [ %i0 + 0x30 ] the_watchdog->user_data = user_data; 20170a4: f6 26 20 34 st %i3, [ %i0 + 0x34 ] 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(); 20170a8: f2 26 20 1c st %i1, [ %i0 + 0x1c ] (*timer_server->schedule_operation)( timer_server, the_timer ); 20170ac: 9f c0 40 00 call %g1 20170b0: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 20170b4: 40 00 0e 47 call 201a9d0 <_Thread_Enable_dispatch> 20170b8: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 20170bc: 81 c7 e0 08 ret 20170c0: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 20170c4: b0 10 20 04 mov 4, %i0 } 20170c8: 81 c7 e0 08 ret 20170cc: 81 e8 00 00 restore =============================================================================== 0200681c : #include int sched_get_priority_max( int policy ) { 200681c: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 2006820: 80 a6 20 04 cmp %i0, 4 2006824: 18 80 00 06 bgu 200683c 2006828: 82 10 20 01 mov 1, %g1 200682c: b1 28 40 18 sll %g1, %i0, %i0 2006830: 80 8e 20 17 btst 0x17, %i0 2006834: 12 80 00 08 bne 2006854 <== ALWAYS TAKEN 2006838: 03 00 80 71 sethi %hi(0x201c400), %g1 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 200683c: 40 00 22 aa call 200f2e4 <__errno> 2006840: b0 10 3f ff mov -1, %i0 2006844: 82 10 20 16 mov 0x16, %g1 2006848: c2 22 00 00 st %g1, [ %o0 ] 200684c: 81 c7 e0 08 ret 2006850: 81 e8 00 00 restore } return POSIX_SCHEDULER_MAXIMUM_PRIORITY; 2006854: f0 08 63 5c ldub [ %g1 + 0x35c ], %i0 } 2006858: 81 c7 e0 08 ret 200685c: 91 ee 3f ff restore %i0, -1, %o0 =============================================================================== 02006860 : #include int sched_get_priority_min( int policy ) { 2006860: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 2006864: 80 a6 20 04 cmp %i0, 4 2006868: 18 80 00 06 bgu 2006880 200686c: 82 10 20 01 mov 1, %g1 2006870: 83 28 40 18 sll %g1, %i0, %g1 2006874: 80 88 60 17 btst 0x17, %g1 2006878: 12 80 00 06 bne 2006890 <== ALWAYS TAKEN 200687c: b0 10 20 01 mov 1, %i0 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2006880: 40 00 22 99 call 200f2e4 <__errno> 2006884: b0 10 3f ff mov -1, %i0 2006888: 82 10 20 16 mov 0x16, %g1 200688c: c2 22 00 00 st %g1, [ %o0 ] } return POSIX_SCHEDULER_MINIMUM_PRIORITY; } 2006890: 81 c7 e0 08 ret 2006894: 81 e8 00 00 restore =============================================================================== 02006898 : int sched_rr_get_interval( pid_t pid, struct timespec *interval ) { 2006898: 9d e3 bf a0 save %sp, -96, %sp /* * Only supported for the "calling process" (i.e. this node). */ if ( pid && pid != getpid() ) 200689c: 80 a6 20 00 cmp %i0, 0 20068a0: 02 80 00 0b be 20068cc <== NEVER TAKEN 20068a4: 80 a6 60 00 cmp %i1, 0 20068a8: 7f ff f2 44 call 20031b8 20068ac: 01 00 00 00 nop 20068b0: 80 a6 00 08 cmp %i0, %o0 20068b4: 02 80 00 06 be 20068cc 20068b8: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); 20068bc: 40 00 22 8a call 200f2e4 <__errno> 20068c0: 01 00 00 00 nop 20068c4: 10 80 00 07 b 20068e0 20068c8: 82 10 20 03 mov 3, %g1 ! 3 if ( !interval ) 20068cc: 12 80 00 08 bne 20068ec 20068d0: 03 00 80 74 sethi %hi(0x201d000), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 20068d4: 40 00 22 84 call 200f2e4 <__errno> 20068d8: 01 00 00 00 nop 20068dc: 82 10 20 16 mov 0x16, %g1 ! 16 20068e0: c2 22 00 00 st %g1, [ %o0 ] 20068e4: 81 c7 e0 08 ret 20068e8: 91 e8 3f ff restore %g0, -1, %o0 _Timespec_From_ticks( _Thread_Ticks_per_timeslice, interval ); 20068ec: d0 00 63 a4 ld [ %g1 + 0x3a4 ], %o0 20068f0: 92 10 00 19 mov %i1, %o1 20068f4: 40 00 0e 8e call 200a32c <_Timespec_From_ticks> 20068f8: b0 10 20 00 clr %i0 return 0; } 20068fc: 81 c7 e0 08 ret 2006900: 81 e8 00 00 restore =============================================================================== 02009480 : int oflag, ... /* mode_t mode, */ /* unsigned int value */ ) { 2009480: 9d e3 bf 90 save %sp, -112, %sp * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2009484: 03 00 80 89 sethi %hi(0x2022400), %g1 2009488: c4 00 63 10 ld [ %g1 + 0x310 ], %g2 ! 2022710 <_Thread_Dispatch_disable_level> Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 200948c: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 2009490: 84 00 a0 01 inc %g2 2009494: c4 20 63 10 st %g2, [ %g1 + 0x310 ] return _Thread_Dispatch_disable_level; 2009498: c2 00 63 10 ld [ %g1 + 0x310 ], %g1 200949c: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 20094a0: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 20094a4: fa 27 a0 58 st %i5, [ %fp + 0x58 ] POSIX_Semaphore_Control *the_semaphore; Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { 20094a8: b8 8e 62 00 andcc %i1, 0x200, %i4 20094ac: 02 80 00 05 be 20094c0 20094b0: ba 10 20 00 clr %i5 va_start(arg, oflag); mode = (mode_t) va_arg( arg, unsigned int ); value = va_arg( arg, unsigned int ); 20094b4: fa 07 a0 50 ld [ %fp + 0x50 ], %i5 20094b8: 82 07 a0 54 add %fp, 0x54, %g1 20094bc: c2 27 bf f0 st %g1, [ %fp + -16 ] va_end(arg); } status = _POSIX_Semaphore_Name_to_id( name, &the_semaphore_id ); 20094c0: 90 10 00 18 mov %i0, %o0 20094c4: 40 00 1a 20 call 200fd44 <_POSIX_Semaphore_Name_to_id> 20094c8: 92 07 bf f4 add %fp, -12, %o1 * and we can just return a pointer to the id. Otherwise we may * need to check to see if this is a "semaphore does not exist" * or some other miscellaneous error on the name. */ if ( status ) { 20094cc: b6 92 20 00 orcc %o0, 0, %i3 20094d0: 22 80 00 0e be,a 2009508 20094d4: 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) ) ) { 20094d8: 80 a6 e0 02 cmp %i3, 2 20094dc: 12 80 00 04 bne 20094ec <== NEVER TAKEN 20094e0: 80 a7 20 00 cmp %i4, 0 20094e4: 12 80 00 21 bne 2009568 20094e8: 94 10 00 1d mov %i5, %o2 _Thread_Enable_dispatch(); 20094ec: 40 00 0c 25 call 200c580 <_Thread_Enable_dispatch> 20094f0: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, sem_t * ); 20094f4: 40 00 25 e0 call 2012c74 <__errno> 20094f8: 01 00 00 00 nop 20094fc: f6 22 00 00 st %i3, [ %o0 ] 2009500: 81 c7 e0 08 ret 2009504: 81 e8 00 00 restore /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { 2009508: 80 a6 6a 00 cmp %i1, 0xa00 200950c: 12 80 00 0a bne 2009534 2009510: d2 07 bf f4 ld [ %fp + -12 ], %o1 _Thread_Enable_dispatch(); 2009514: 40 00 0c 1b call 200c580 <_Thread_Enable_dispatch> 2009518: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); 200951c: 40 00 25 d6 call 2012c74 <__errno> 2009520: 01 00 00 00 nop 2009524: 82 10 20 11 mov 0x11, %g1 ! 11 2009528: c2 22 00 00 st %g1, [ %o0 ] 200952c: 81 c7 e0 08 ret 2009530: 81 e8 00 00 restore 2009534: 94 07 bf fc add %fp, -4, %o2 2009538: 11 00 80 8a sethi %hi(0x2022800), %o0 200953c: 40 00 08 61 call 200b6c0 <_Objects_Get> 2009540: 90 12 21 d0 or %o0, 0x1d0, %o0 ! 20229d0 <_POSIX_Semaphore_Information> } the_semaphore = _POSIX_Semaphore_Get( &the_semaphore_id, &location ); the_semaphore->open_count += 1; 2009544: c2 02 20 18 ld [ %o0 + 0x18 ], %g1 if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { _Thread_Enable_dispatch(); rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); } the_semaphore = _POSIX_Semaphore_Get( &the_semaphore_id, &location ); 2009548: d0 27 bf f8 st %o0, [ %fp + -8 ] the_semaphore->open_count += 1; 200954c: 82 00 60 01 inc %g1 _Thread_Enable_dispatch(); 2009550: 40 00 0c 0c call 200c580 <_Thread_Enable_dispatch> 2009554: c2 22 20 18 st %g1, [ %o0 + 0x18 ] _Thread_Enable_dispatch(); 2009558: 40 00 0c 0a call 200c580 <_Thread_Enable_dispatch> 200955c: 01 00 00 00 nop goto return_id; 2009560: 10 80 00 0c b 2009590 2009564: f0 07 bf f8 ld [ %fp + -8 ], %i0 /* * 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( 2009568: 90 10 00 18 mov %i0, %o0 200956c: 92 10 20 00 clr %o1 2009570: 40 00 19 9d call 200fbe4 <_POSIX_Semaphore_Create_support> 2009574: 96 07 bf f8 add %fp, -8, %o3 /* * errno was set by Create_support, so don't set it again. */ _Thread_Enable_dispatch(); 2009578: 40 00 0c 02 call 200c580 <_Thread_Enable_dispatch> 200957c: ba 10 00 08 mov %o0, %i5 if ( status == -1 ) 2009580: 80 a7 7f ff cmp %i5, -1 2009584: 02 bf ff ea be 200952c 2009588: b0 10 3f ff mov -1, %i0 the_semaphore->Semaphore_id = the_semaphore->Object.id; id = &the_semaphore->Semaphore_id; #else id = (sem_t *)&the_semaphore->Object.id; #endif return id; 200958c: f0 07 bf f8 ld [ %fp + -8 ], %i0 2009590: b0 06 20 08 add %i0, 8, %i0 } 2009594: 81 c7 e0 08 ret 2009598: 81 e8 00 00 restore =============================================================================== 0200672c : int sigaction( int sig, const struct sigaction *act, struct sigaction *oact ) { 200672c: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; if ( oact ) 2006730: 90 96 a0 00 orcc %i2, 0, %o0 2006734: 02 80 00 09 be 2006758 2006738: 83 2e 20 02 sll %i0, 2, %g1 *oact = _POSIX_signals_Vectors[ sig ]; 200673c: 85 2e 20 04 sll %i0, 4, %g2 2006740: 82 20 80 01 sub %g2, %g1, %g1 2006744: 13 00 80 66 sethi %hi(0x2019800), %o1 2006748: 94 10 20 0c mov 0xc, %o2 200674c: 92 12 62 e0 or %o1, 0x2e0, %o1 2006750: 40 00 26 3f call 201004c 2006754: 92 02 40 01 add %o1, %g1, %o1 if ( !sig ) 2006758: 80 a6 20 00 cmp %i0, 0 200675c: 02 80 00 09 be 2006780 2006760: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 2006764: 82 06 3f ff add %i0, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 2006768: 80 a0 60 1f cmp %g1, 0x1f 200676c: 18 80 00 05 bgu 2006780 2006770: 01 00 00 00 nop * * NOTE: Solaris documentation claims to "silently enforce" this which * contradicts the POSIX specification. */ if ( sig == SIGKILL ) 2006774: 80 a6 20 09 cmp %i0, 9 2006778: 12 80 00 08 bne 2006798 200677c: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); 2006780: 40 00 23 ed call 200f734 <__errno> 2006784: 01 00 00 00 nop 2006788: 82 10 20 16 mov 0x16, %g1 ! 16 200678c: c2 22 00 00 st %g1, [ %o0 ] 2006790: 10 80 00 20 b 2006810 2006794: 82 10 3f ff mov -1, %g1 /* * Evaluate the new action structure and set the global signal vector * appropriately. */ if ( act ) { 2006798: 02 80 00 1e be 2006810 <== NEVER TAKEN 200679c: 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 ); 20067a0: 7f ff ef 5f call 200251c 20067a4: 01 00 00 00 nop 20067a8: ba 10 00 08 mov %o0, %i5 if ( act->sa_handler == SIG_DFL ) { 20067ac: c2 06 60 08 ld [ %i1 + 8 ], %g1 20067b0: 39 00 80 66 sethi %hi(0x2019800), %i4 20067b4: 80 a0 60 00 cmp %g1, 0 20067b8: 12 80 00 0a bne 20067e0 20067bc: b8 17 22 e0 or %i4, 0x2e0, %i4 _POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ]; 20067c0: 83 2e 20 02 sll %i0, 2, %g1 20067c4: 13 00 80 5f sethi %hi(0x2017c00), %o1 20067c8: b1 2e 20 04 sll %i0, 4, %i0 20067cc: 92 12 63 8c or %o1, 0x38c, %o1 20067d0: b0 26 00 01 sub %i0, %g1, %i0 20067d4: 90 07 00 18 add %i4, %i0, %o0 20067d8: 10 80 00 09 b 20067fc 20067dc: 92 02 40 18 add %o1, %i0, %o1 } else { _POSIX_signals_Clear_process_signals( sig ); 20067e0: 40 00 18 0b call 200c80c <_POSIX_signals_Clear_process_signals> 20067e4: 90 10 00 18 mov %i0, %o0 _POSIX_signals_Vectors[ sig ] = *act; 20067e8: 83 2e 20 02 sll %i0, 2, %g1 20067ec: 92 10 00 19 mov %i1, %o1 20067f0: b1 2e 20 04 sll %i0, 4, %i0 20067f4: 90 26 00 01 sub %i0, %g1, %o0 20067f8: 90 07 00 08 add %i4, %o0, %o0 20067fc: 40 00 26 14 call 201004c 2006800: 94 10 20 0c mov 0xc, %o2 } _ISR_Enable( level ); 2006804: 7f ff ef 4a call 200252c 2006808: 90 10 00 1d mov %i5, %o0 * now (signals not posted when SIG_IGN). * + If we are now ignoring a signal that was previously pending, * we clear the pending signal indicator. */ return 0; 200680c: 82 10 20 00 clr %g1 } 2006810: 81 c7 e0 08 ret 2006814: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 02006c70 : int sigtimedwait( const sigset_t *set, siginfo_t *info, const struct timespec *timeout ) { 2006c70: 9d e3 bf 90 save %sp, -112, %sp ISR_Level level; /* * Error check parameters before disabling interrupts. */ if ( !set ) 2006c74: ba 96 20 00 orcc %i0, 0, %i5 2006c78: 02 80 00 0f be 2006cb4 2006c7c: 01 00 00 00 nop /* NOTE: This is very specifically a RELATIVE not ABSOLUTE time * in the Open Group specification. */ interval = 0; if ( timeout ) { 2006c80: 80 a6 a0 00 cmp %i2, 0 2006c84: 02 80 00 12 be 2006ccc 2006c88: a0 10 20 00 clr %l0 if ( !_Timespec_Is_valid( timeout ) ) 2006c8c: 40 00 0e bd call 200a780 <_Timespec_Is_valid> 2006c90: 90 10 00 1a mov %i2, %o0 2006c94: 80 8a 20 ff btst 0xff, %o0 2006c98: 02 80 00 07 be 2006cb4 2006c9c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); interval = _Timespec_To_ticks( timeout ); 2006ca0: 40 00 0e da call 200a808 <_Timespec_To_ticks> 2006ca4: 90 10 00 1a mov %i2, %o0 if ( !interval ) 2006ca8: a0 92 20 00 orcc %o0, 0, %l0 2006cac: 12 80 00 09 bne 2006cd0 <== ALWAYS TAKEN 2006cb0: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); 2006cb4: 40 00 24 6c call 200fe64 <__errno> 2006cb8: b0 10 3f ff mov -1, %i0 2006cbc: 82 10 20 16 mov 0x16, %g1 2006cc0: c2 22 00 00 st %g1, [ %o0 ] 2006cc4: 81 c7 e0 08 ret 2006cc8: 81 e8 00 00 restore /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 2006ccc: 80 a6 60 00 cmp %i1, 0 2006cd0: 22 80 00 02 be,a 2006cd8 2006cd4: b2 07 bf f4 add %fp, -12, %i1 the_thread = _Thread_Executing; 2006cd8: 31 00 80 68 sethi %hi(0x201a000), %i0 2006cdc: b0 16 22 98 or %i0, 0x298, %i0 ! 201a298 <_Per_CPU_Information> 2006ce0: f4 06 20 0c ld [ %i0 + 0xc ], %i2 * What if they are already pending? */ /* API signals pending? */ _ISR_Disable( level ); 2006ce4: 7f ff ee e9 call 2002888 2006ce8: f6 06 a1 5c ld [ %i2 + 0x15c ], %i3 2006cec: b8 10 00 08 mov %o0, %i4 if ( *set & api->signals_pending ) { 2006cf0: c4 07 40 00 ld [ %i5 ], %g2 2006cf4: c2 06 e0 d4 ld [ %i3 + 0xd4 ], %g1 2006cf8: 80 88 80 01 btst %g2, %g1 2006cfc: 22 80 00 13 be,a 2006d48 2006d00: 03 00 80 69 sethi %hi(0x201a400), %g1 /* XXX real info later */ the_info->si_signo = _POSIX_signals_Get_lowest( api->signals_pending ); 2006d04: 7f ff ff c3 call 2006c10 <_POSIX_signals_Get_lowest> 2006d08: 90 10 00 01 mov %g1, %o0 _POSIX_signals_Clear_signals( 2006d0c: 94 10 00 19 mov %i1, %o2 /* API signals pending? */ _ISR_Disable( level ); if ( *set & api->signals_pending ) { /* XXX real info later */ the_info->si_signo = _POSIX_signals_Get_lowest( api->signals_pending ); 2006d10: 92 10 00 08 mov %o0, %o1 2006d14: d0 26 40 00 st %o0, [ %i1 ] _POSIX_signals_Clear_signals( 2006d18: 96 10 20 00 clr %o3 2006d1c: 90 10 00 1b mov %i3, %o0 2006d20: 40 00 18 d9 call 200d084 <_POSIX_signals_Clear_signals> 2006d24: 98 10 20 00 clr %o4 the_info->si_signo, the_info, false, false ); _ISR_Enable( level ); 2006d28: 7f ff ee dc call 2002898 2006d2c: 90 10 00 1c mov %i4, %o0 the_info->si_code = SI_USER; 2006d30: 82 10 20 01 mov 1, %g1 the_info->si_value.sival_int = 0; 2006d34: c0 26 60 08 clr [ %i1 + 8 ] false, false ); _ISR_Enable( level ); the_info->si_code = SI_USER; 2006d38: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; return the_info->si_signo; 2006d3c: f0 06 40 00 ld [ %i1 ], %i0 2006d40: 81 c7 e0 08 ret 2006d44: 81 e8 00 00 restore } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { 2006d48: c2 00 60 e4 ld [ %g1 + 0xe4 ], %g1 2006d4c: 80 88 80 01 btst %g2, %g1 2006d50: 22 80 00 13 be,a 2006d9c 2006d54: 82 10 3f ff mov -1, %g1 signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 2006d58: 7f ff ff ae call 2006c10 <_POSIX_signals_Get_lowest> 2006d5c: 90 10 00 01 mov %g1, %o0 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 2006d60: 94 10 00 19 mov %i1, %o2 } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 2006d64: b0 10 00 08 mov %o0, %i0 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 2006d68: 96 10 20 01 mov 1, %o3 2006d6c: 90 10 00 1b mov %i3, %o0 2006d70: 92 10 00 18 mov %i0, %o1 2006d74: 40 00 18 c4 call 200d084 <_POSIX_signals_Clear_signals> 2006d78: 98 10 20 00 clr %o4 _ISR_Enable( level ); 2006d7c: 7f ff ee c7 call 2002898 2006d80: 90 10 00 1c mov %i4, %o0 the_info->si_signo = signo; the_info->si_code = SI_USER; 2006d84: 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; 2006d88: f0 26 40 00 st %i0, [ %i1 ] the_info->si_code = SI_USER; 2006d8c: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; 2006d90: c0 26 60 08 clr [ %i1 + 8 ] return signo; 2006d94: 81 c7 e0 08 ret 2006d98: 81 e8 00 00 restore } the_info->si_signo = -1; 2006d9c: c2 26 40 00 st %g1, [ %i1 ] * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2006da0: 03 00 80 67 sethi %hi(0x2019c00), %g1 2006da4: c4 00 61 60 ld [ %g1 + 0x160 ], %g2 ! 2019d60 <_Thread_Dispatch_disable_level> 2006da8: 84 00 a0 01 inc %g2 2006dac: c4 20 61 60 st %g2, [ %g1 + 0x160 ] return _Thread_Dispatch_disable_level; 2006db0: c2 00 61 60 ld [ %g1 + 0x160 ], %g1 _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; the_thread->Wait.return_code = EINTR; 2006db4: 82 10 20 04 mov 4, %g1 2006db8: c2 26 a0 34 st %g1, [ %i2 + 0x34 ] the_thread->Wait.option = *set; 2006dbc: c2 07 40 00 ld [ %i5 ], %g1 the_thread->Wait.return_argument = the_info; 2006dc0: f2 26 a0 28 st %i1, [ %i2 + 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; 2006dc4: c2 26 a0 30 st %g1, [ %i2 + 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; 2006dc8: b8 10 20 01 mov 1, %i4 } the_info->si_signo = -1; _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; 2006dcc: 23 00 80 69 sethi %hi(0x201a400), %l1 2006dd0: a2 14 60 7c or %l1, 0x7c, %l1 ! 201a47c <_POSIX_signals_Wait_queue> 2006dd4: e2 26 a0 44 st %l1, [ %i2 + 0x44 ] 2006dd8: f8 24 60 30 st %i4, [ %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 ); 2006ddc: 7f ff ee af call 2002898 2006de0: 01 00 00 00 nop _Thread_queue_Enqueue( &_POSIX_signals_Wait_queue, interval ); 2006de4: 90 10 00 11 mov %l1, %o0 2006de8: 92 10 00 10 mov %l0, %o1 2006dec: 15 00 80 29 sethi %hi(0x200a400), %o2 2006df0: 40 00 0c e6 call 200a188 <_Thread_queue_Enqueue_with_handler> 2006df4: 94 12 a0 f4 or %o2, 0xf4, %o2 ! 200a4f4 <_Thread_queue_Timeout> _Thread_Enable_dispatch(); 2006df8: 40 00 0b a9 call 2009c9c <_Thread_Enable_dispatch> 2006dfc: 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 ); 2006e00: d2 06 40 00 ld [ %i1 ], %o1 2006e04: 90 10 00 1b mov %i3, %o0 2006e08: 94 10 00 19 mov %i1, %o2 2006e0c: 96 10 20 00 clr %o3 2006e10: 40 00 18 9d call 200d084 <_POSIX_signals_Clear_signals> 2006e14: 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) 2006e18: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2006e1c: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2006e20: 80 a0 60 04 cmp %g1, 4 2006e24: 12 80 00 09 bne 2006e48 2006e28: 01 00 00 00 nop || !(*set & signo_to_mask( the_info->si_signo )) ) { 2006e2c: f0 06 40 00 ld [ %i1 ], %i0 2006e30: 82 06 3f ff add %i0, -1, %g1 2006e34: b9 2f 00 01 sll %i4, %g1, %i4 2006e38: c2 07 40 00 ld [ %i5 ], %g1 2006e3c: 80 8f 00 01 btst %i4, %g1 2006e40: 12 80 00 08 bne 2006e60 2006e44: 01 00 00 00 nop errno = _Thread_Executing->Wait.return_code; 2006e48: 40 00 24 07 call 200fe64 <__errno> 2006e4c: b0 10 3f ff mov -1, %i0 ! ffffffff 2006e50: 03 00 80 68 sethi %hi(0x201a000), %g1 2006e54: c2 00 62 a4 ld [ %g1 + 0x2a4 ], %g1 ! 201a2a4 <_Per_CPU_Information+0xc> 2006e58: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2006e5c: c2 22 00 00 st %g1, [ %o0 ] return -1; } return the_info->si_signo; } 2006e60: 81 c7 e0 08 ret 2006e64: 81 e8 00 00 restore =============================================================================== 02008bc0 : int sigwait( const sigset_t *set, int *sig ) { 2008bc0: 9d e3 bf a0 save %sp, -96, %sp int status; status = sigtimedwait( set, NULL, NULL ); 2008bc4: 92 10 20 00 clr %o1 2008bc8: 90 10 00 18 mov %i0, %o0 2008bcc: 7f ff ff 7b call 20089b8 2008bd0: 94 10 20 00 clr %o2 if ( status != -1 ) { 2008bd4: 80 a2 3f ff cmp %o0, -1 2008bd8: 02 80 00 07 be 2008bf4 2008bdc: 80 a6 60 00 cmp %i1, 0 if ( sig ) 2008be0: 02 80 00 03 be 2008bec <== NEVER TAKEN 2008be4: b0 10 20 00 clr %i0 *sig = status; 2008be8: d0 26 40 00 st %o0, [ %i1 ] 2008bec: 81 c7 e0 08 ret 2008bf0: 81 e8 00 00 restore return 0; } return errno; 2008bf4: 40 00 23 43 call 2011900 <__errno> 2008bf8: 01 00 00 00 nop 2008bfc: f0 02 00 00 ld [ %o0 ], %i0 } 2008c00: 81 c7 e0 08 ret 2008c04: 81 e8 00 00 restore =============================================================================== 02005ac4 : */ long sysconf( int name ) { 2005ac4: 9d e3 bf a0 save %sp, -96, %sp if ( name == _SC_CLK_TCK ) 2005ac8: 80 a6 20 02 cmp %i0, 2 2005acc: 12 80 00 09 bne 2005af0 2005ad0: 03 00 80 59 sethi %hi(0x2016400), %g1 return (TOD_MICROSECONDS_PER_SECOND / 2005ad4: 03 00 80 58 sethi %hi(0x2016000), %g1 2005ad8: d2 00 62 c8 ld [ %g1 + 0x2c8 ], %o1 ! 20162c8 2005adc: 11 00 03 d0 sethi %hi(0xf4000), %o0 2005ae0: 40 00 33 34 call 20127b0 <.udiv> 2005ae4: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 2005ae8: 81 c7 e0 08 ret 2005aec: 91 e8 00 08 restore %g0, %o0, %o0 rtems_configuration_get_microseconds_per_tick()); if ( name == _SC_OPEN_MAX ) 2005af0: 80 a6 20 04 cmp %i0, 4 2005af4: 02 80 00 10 be 2005b34 2005af8: d0 00 60 04 ld [ %g1 + 4 ], %o0 return rtems_libio_number_iops; if ( name == _SC_GETPW_R_SIZE_MAX ) 2005afc: 80 a6 20 33 cmp %i0, 0x33 2005b00: 02 80 00 0d be 2005b34 2005b04: 90 10 24 00 mov 0x400, %o0 return 1024; if ( name == _SC_PAGESIZE ) 2005b08: 80 a6 20 08 cmp %i0, 8 2005b0c: 02 80 00 0a be 2005b34 2005b10: 11 00 00 04 sethi %hi(0x1000), %o0 return PAGE_SIZE; #if defined(__sparc__) if ( name == 515 ) /* Solaris _SC_STACK_PROT */ 2005b14: 80 a6 22 03 cmp %i0, 0x203 2005b18: 02 80 00 07 be 2005b34 <== NEVER TAKEN 2005b1c: 90 10 20 00 clr %o0 return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); 2005b20: 40 00 23 dd call 200ea94 <__errno> 2005b24: 01 00 00 00 nop 2005b28: 82 10 20 16 mov 0x16, %g1 ! 16 2005b2c: c2 22 00 00 st %g1, [ %o0 ] 2005b30: 90 10 3f ff mov -1, %o0 } 2005b34: b0 10 00 08 mov %o0, %i0 2005b38: 81 c7 e0 08 ret 2005b3c: 81 e8 00 00 restore =============================================================================== 02005e68 : int timer_create( clockid_t clock_id, struct sigevent *evp, timer_t *timerid ) { 2005e68: 9d e3 bf a0 save %sp, -96, %sp POSIX_Timer_Control *ptimer; if ( clock_id != CLOCK_REALTIME ) 2005e6c: 80 a6 20 01 cmp %i0, 1 2005e70: 12 80 00 15 bne 2005ec4 2005e74: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); if ( !timerid ) 2005e78: 80 a6 a0 00 cmp %i2, 0 2005e7c: 02 80 00 12 be 2005ec4 2005e80: 01 00 00 00 nop /* * The data of the structure evp are checked in order to verify if they * are coherent. */ if (evp != NULL) { 2005e84: 80 a6 60 00 cmp %i1, 0 2005e88: 02 80 00 13 be 2005ed4 2005e8c: 03 00 80 75 sethi %hi(0x201d400), %g1 /* The structure has data */ if ( ( evp->sigev_notify != SIGEV_NONE ) && 2005e90: c2 06 40 00 ld [ %i1 ], %g1 2005e94: 82 00 7f ff add %g1, -1, %g1 2005e98: 80 a0 60 01 cmp %g1, 1 2005e9c: 18 80 00 0a bgu 2005ec4 <== NEVER TAKEN 2005ea0: 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 ) 2005ea4: c2 06 60 04 ld [ %i1 + 4 ], %g1 2005ea8: 80 a0 60 00 cmp %g1, 0 2005eac: 02 80 00 06 be 2005ec4 <== NEVER TAKEN 2005eb0: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 2005eb4: 82 00 7f ff add %g1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(evp->sigev_signo) ) 2005eb8: 80 a0 60 1f cmp %g1, 0x1f 2005ebc: 28 80 00 06 bleu,a 2005ed4 <== ALWAYS TAKEN 2005ec0: 03 00 80 75 sethi %hi(0x201d400), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 2005ec4: 40 00 25 04 call 200f2d4 <__errno> 2005ec8: 01 00 00 00 nop 2005ecc: 10 80 00 11 b 2005f10 2005ed0: 82 10 20 16 mov 0x16, %g1 ! 16 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2005ed4: c4 00 60 50 ld [ %g1 + 0x50 ], %g2 2005ed8: 84 00 a0 01 inc %g2 2005edc: c4 20 60 50 st %g2, [ %g1 + 0x50 ] return _Thread_Dispatch_disable_level; 2005ee0: c2 00 60 50 ld [ %g1 + 0x50 ], %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 ); 2005ee4: 11 00 80 75 sethi %hi(0x201d400), %o0 2005ee8: 40 00 07 e7 call 2007e84 <_Objects_Allocate> 2005eec: 90 12 23 50 or %o0, 0x350, %o0 ! 201d750 <_POSIX_Timer_Information> /* * Allocate a timer */ ptimer = _POSIX_Timer_Allocate(); if ( !ptimer ) { 2005ef0: 80 a2 20 00 cmp %o0, 0 2005ef4: 12 80 00 0a bne 2005f1c 2005ef8: 82 10 20 02 mov 2, %g1 _Thread_Enable_dispatch(); 2005efc: 40 00 0c ae call 20091b4 <_Thread_Enable_dispatch> 2005f00: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EAGAIN ); 2005f04: 40 00 24 f4 call 200f2d4 <__errno> 2005f08: 01 00 00 00 nop 2005f0c: 82 10 20 0b mov 0xb, %g1 ! b 2005f10: c2 22 00 00 st %g1, [ %o0 ] 2005f14: 81 c7 e0 08 ret 2005f18: 91 e8 3f ff restore %g0, -1, %o0 } /* The data of the created timer are stored to use them later */ ptimer->state = POSIX_TIMER_STATE_CREATE_NEW; 2005f1c: c2 2a 20 3c stb %g1, [ %o0 + 0x3c ] ptimer->thread_id = _Thread_Executing->Object.id; 2005f20: 03 00 80 76 sethi %hi(0x201d800), %g1 2005f24: c2 00 61 94 ld [ %g1 + 0x194 ], %g1 ! 201d994 <_Per_CPU_Information+0xc> if ( evp != NULL ) { 2005f28: 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; 2005f2c: c2 00 60 08 ld [ %g1 + 8 ], %g1 if ( evp != NULL ) { 2005f30: 02 80 00 08 be 2005f50 2005f34: c2 22 20 38 st %g1, [ %o0 + 0x38 ] ptimer->inf.sigev_notify = evp->sigev_notify; 2005f38: c2 06 40 00 ld [ %i1 ], %g1 2005f3c: c2 22 20 40 st %g1, [ %o0 + 0x40 ] ptimer->inf.sigev_signo = evp->sigev_signo; 2005f40: c2 06 60 04 ld [ %i1 + 4 ], %g1 2005f44: c2 22 20 44 st %g1, [ %o0 + 0x44 ] ptimer->inf.sigev_value = evp->sigev_value; 2005f48: c2 06 60 08 ld [ %i1 + 8 ], %g1 2005f4c: c2 22 20 48 st %g1, [ %o0 + 0x48 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2005f50: c4 12 20 0a lduh [ %o0 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2005f54: 07 00 80 75 sethi %hi(0x201d400), %g3 2005f58: c6 00 e3 6c ld [ %g3 + 0x36c ], %g3 ! 201d76c <_POSIX_Timer_Information+0x1c> } ptimer->overrun = 0; 2005f5c: c0 22 20 68 clr [ %o0 + 0x68 ] ptimer->timer_data.it_value.tv_sec = 0; 2005f60: c0 22 20 5c clr [ %o0 + 0x5c ] ptimer->timer_data.it_value.tv_nsec = 0; 2005f64: c0 22 20 60 clr [ %o0 + 0x60 ] ptimer->timer_data.it_interval.tv_sec = 0; 2005f68: c0 22 20 54 clr [ %o0 + 0x54 ] ptimer->timer_data.it_interval.tv_nsec = 0; 2005f6c: c0 22 20 58 clr [ %o0 + 0x58 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2005f70: c0 22 20 18 clr [ %o0 + 0x18 ] the_watchdog->routine = routine; 2005f74: c0 22 20 2c clr [ %o0 + 0x2c ] the_watchdog->id = id; 2005f78: c0 22 20 30 clr [ %o0 + 0x30 ] the_watchdog->user_data = user_data; 2005f7c: c0 22 20 34 clr [ %o0 + 0x34 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2005f80: c2 02 20 08 ld [ %o0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2005f84: 85 28 a0 02 sll %g2, 2, %g2 2005f88: 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; 2005f8c: 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; 2005f90: c2 26 80 00 st %g1, [ %i2 ] _Thread_Enable_dispatch(); 2005f94: 40 00 0c 88 call 20091b4 <_Thread_Enable_dispatch> 2005f98: b0 10 20 00 clr %i0 return 0; } 2005f9c: 81 c7 e0 08 ret 2005fa0: 81 e8 00 00 restore =============================================================================== 02005fa4 : timer_t timerid, int flags, const struct itimerspec *value, struct itimerspec *ovalue ) { 2005fa4: 9d e3 bf 80 save %sp, -128, %sp Objects_Locations location; bool activated; uint32_t initial_period; struct itimerspec normalize; if ( !value ) 2005fa8: 80 a6 a0 00 cmp %i2, 0 2005fac: 02 80 00 20 be 200602c <== NEVER TAKEN 2005fb0: 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) ) ) { 2005fb4: 40 00 0f 49 call 2009cd8 <_Timespec_Is_valid> 2005fb8: 90 06 a0 08 add %i2, 8, %o0 2005fbc: 80 8a 20 ff btst 0xff, %o0 2005fc0: 02 80 00 1b be 200602c 2005fc4: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } if ( !_Timespec_Is_valid( &(value->it_interval) ) ) { 2005fc8: 40 00 0f 44 call 2009cd8 <_Timespec_Is_valid> 2005fcc: 90 10 00 1a mov %i2, %o0 2005fd0: 80 8a 20 ff btst 0xff, %o0 2005fd4: 02 80 00 16 be 200602c <== NEVER TAKEN 2005fd8: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) { 2005fdc: 80 a6 60 00 cmp %i1, 0 2005fe0: 02 80 00 05 be 2005ff4 2005fe4: 90 07 bf e4 add %fp, -28, %o0 2005fe8: 80 a6 60 04 cmp %i1, 4 2005fec: 12 80 00 10 bne 200602c 2005ff0: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } normalize = *value; 2005ff4: 92 10 00 1a mov %i2, %o1 2005ff8: 40 00 27 13 call 200fc44 2005ffc: 94 10 20 10 mov 0x10, %o2 /* Convert absolute to relative time */ if (flags == TIMER_ABSTIME) { 2006000: 80 a6 60 04 cmp %i1, 4 2006004: 12 80 00 14 bne 2006054 2006008: 92 10 00 18 mov %i0, %o1 struct timespec now; _TOD_Get( &now ); 200600c: 40 00 06 2a call 20078b4 <_TOD_Get> 2006010: 90 07 bf f4 add %fp, -12, %o0 /* Check for seconds in the past */ if ( _Timespec_Greater_than( &now, &normalize.it_value ) ) 2006014: 90 07 bf f4 add %fp, -12, %o0 2006018: 40 00 0f 20 call 2009c98 <_Timespec_Greater_than> 200601c: 92 07 bf ec add %fp, -20, %o1 2006020: 80 8a 20 ff btst 0xff, %o0 2006024: 02 80 00 08 be 2006044 2006028: 92 07 bf ec add %fp, -20, %o1 rtems_set_errno_and_return_minus_one( EINVAL ); 200602c: 40 00 24 aa call 200f2d4 <__errno> 2006030: b0 10 3f ff mov -1, %i0 2006034: 82 10 20 16 mov 0x16, %g1 2006038: c2 22 00 00 st %g1, [ %o0 ] 200603c: 81 c7 e0 08 ret 2006040: 81 e8 00 00 restore _Timespec_Subtract( &now, &normalize.it_value, &normalize.it_value ); 2006044: 90 07 bf f4 add %fp, -12, %o0 2006048: 40 00 0f 35 call 2009d1c <_Timespec_Subtract> 200604c: 94 10 00 09 mov %o1, %o2 RTEMS_INLINE_ROUTINE POSIX_Timer_Control *_POSIX_Timer_Get ( timer_t id, Objects_Locations *location ) { return (POSIX_Timer_Control *) 2006050: 92 10 00 18 mov %i0, %o1 2006054: 11 00 80 75 sethi %hi(0x201d400), %o0 2006058: 94 07 bf fc add %fp, -4, %o2 200605c: 40 00 08 c5 call 2008370 <_Objects_Get> 2006060: 90 12 23 50 or %o0, 0x350, %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 ) { 2006064: c2 07 bf fc ld [ %fp + -4 ], %g1 2006068: 80 a0 60 00 cmp %g1, 0 200606c: 12 80 00 39 bne 2006150 2006070: 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 ) { 2006074: c2 07 bf ec ld [ %fp + -20 ], %g1 2006078: 80 a0 60 00 cmp %g1, 0 200607c: 12 80 00 14 bne 20060cc 2006080: c2 07 bf f0 ld [ %fp + -16 ], %g1 2006084: 80 a0 60 00 cmp %g1, 0 2006088: 12 80 00 11 bne 20060cc 200608c: 01 00 00 00 nop /* Stop the timer */ (void) _Watchdog_Remove( &ptimer->Timer ); 2006090: 40 00 10 56 call 200a1e8 <_Watchdog_Remove> 2006094: 90 02 20 10 add %o0, 0x10, %o0 /* The old data of the timer are returned */ if ( ovalue ) 2006098: 80 a6 e0 00 cmp %i3, 0 200609c: 02 80 00 05 be 20060b0 20060a0: 90 10 00 1b mov %i3, %o0 *ovalue = ptimer->timer_data; 20060a4: 92 06 20 54 add %i0, 0x54, %o1 20060a8: 40 00 26 e7 call 200fc44 20060ac: 94 10 20 10 mov 0x10, %o2 /* The new data are set */ ptimer->timer_data = normalize; 20060b0: 90 06 20 54 add %i0, 0x54, %o0 20060b4: 92 07 bf e4 add %fp, -28, %o1 20060b8: 40 00 26 e3 call 200fc44 20060bc: 94 10 20 10 mov 0x10, %o2 /* Indicates that the timer is created and stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; 20060c0: 82 10 20 04 mov 4, %g1 20060c4: 10 80 00 1f b 2006140 20060c8: c2 2e 20 3c stb %g1, [ %i0 + 0x3c ] _Thread_Enable_dispatch(); return 0; } /* Convert from seconds and nanoseconds to ticks */ ptimer->ticks = _Timespec_To_ticks( &value->it_interval ); 20060cc: 40 00 0f 25 call 2009d60 <_Timespec_To_ticks> 20060d0: 90 10 00 1a mov %i2, %o0 20060d4: d0 26 20 64 st %o0, [ %i0 + 0x64 ] initial_period = _Timespec_To_ticks( &normalize.it_value ); 20060d8: 40 00 0f 22 call 2009d60 <_Timespec_To_ticks> 20060dc: 90 07 bf ec add %fp, -20, %o0 activated = _POSIX_Timer_Insert_helper( 20060e0: 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 ); 20060e4: 92 10 00 08 mov %o0, %o1 activated = _POSIX_Timer_Insert_helper( 20060e8: 17 00 80 18 sethi %hi(0x2006000), %o3 20060ec: 90 06 20 10 add %i0, 0x10, %o0 20060f0: 96 12 e1 68 or %o3, 0x168, %o3 20060f4: 40 00 19 a3 call 200c780 <_POSIX_Timer_Insert_helper> 20060f8: 98 10 00 18 mov %i0, %o4 initial_period, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) { 20060fc: 80 8a 20 ff btst 0xff, %o0 2006100: 02 80 00 10 be 2006140 2006104: 01 00 00 00 nop /* * The timer has been started and is running. So we return the * old ones in "ovalue" */ if ( ovalue ) 2006108: 80 a6 e0 00 cmp %i3, 0 200610c: 02 80 00 05 be 2006120 2006110: 90 10 00 1b mov %i3, %o0 *ovalue = ptimer->timer_data; 2006114: 92 06 20 54 add %i0, 0x54, %o1 2006118: 40 00 26 cb call 200fc44 200611c: 94 10 20 10 mov 0x10, %o2 ptimer->timer_data = normalize; 2006120: 90 06 20 54 add %i0, 0x54, %o0 2006124: 92 07 bf e4 add %fp, -28, %o1 2006128: 40 00 26 c7 call 200fc44 200612c: 94 10 20 10 mov 0x10, %o2 /* Indicate that the time is running */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 2006130: 82 10 20 03 mov 3, %g1 _TOD_Get( &ptimer->time ); 2006134: 90 06 20 6c add %i0, 0x6c, %o0 2006138: 40 00 05 df call 20078b4 <_TOD_Get> 200613c: c2 2e 20 3c stb %g1, [ %i0 + 0x3c ] _Thread_Enable_dispatch(); 2006140: 40 00 0c 1d call 20091b4 <_Thread_Enable_dispatch> 2006144: b0 10 20 00 clr %i0 return 0; 2006148: 81 c7 e0 08 ret 200614c: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EINVAL ); 2006150: 40 00 24 61 call 200f2d4 <__errno> 2006154: b0 10 3f ff mov -1, %i0 2006158: 82 10 20 16 mov 0x16, %g1 200615c: c2 22 00 00 st %g1, [ %o0 ] } 2006160: 81 c7 e0 08 ret 2006164: 81 e8 00 00 restore =============================================================================== 02005dec : useconds_t ualarm( useconds_t useconds, useconds_t interval ) { 2005dec: 9d e3 bf 98 save %sp, -104, %sp /* * Initialize the timer used to implement alarm(). */ if ( !the_timer->routine ) { 2005df0: 39 00 80 61 sethi %hi(0x2018400), %i4 2005df4: b8 17 23 c8 or %i4, 0x3c8, %i4 ! 20187c8 <_POSIX_signals_Ualarm_timer> 2005df8: c2 07 20 1c ld [ %i4 + 0x1c ], %g1 2005dfc: 80 a0 60 00 cmp %g1, 0 2005e00: 12 80 00 0a bne 2005e28 2005e04: ba 10 00 18 mov %i0, %i5 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2005e08: 03 00 80 17 sethi %hi(0x2005c00), %g1 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2005e0c: c0 27 20 08 clr [ %i4 + 8 ] the_watchdog->routine = routine; 2005e10: 82 10 61 c0 or %g1, 0x1c0, %g1 the_watchdog->id = id; 2005e14: c0 27 20 20 clr [ %i4 + 0x20 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2005e18: c2 27 20 1c st %g1, [ %i4 + 0x1c ] the_watchdog->id = id; the_watchdog->user_data = user_data; 2005e1c: c0 27 20 24 clr [ %i4 + 0x24 ] useconds_t ualarm( useconds_t useconds, useconds_t interval ) { useconds_t remaining = 0; 2005e20: 10 80 00 1b b 2005e8c 2005e24: b0 10 20 00 clr %i0 if ( !the_timer->routine ) { _Watchdog_Initialize( the_timer, _POSIX_signals_Ualarm_TSR, 0, NULL ); } else { Watchdog_States state; state = _Watchdog_Remove( the_timer ); 2005e28: 40 00 0f e1 call 2009dac <_Watchdog_Remove> 2005e2c: 90 10 00 1c mov %i4, %o0 if ( (state == WATCHDOG_ACTIVE) || (state == WATCHDOG_REMOVE_IT) ) { 2005e30: 90 02 3f fe add %o0, -2, %o0 2005e34: 80 a2 20 01 cmp %o0, 1 2005e38: 18 80 00 15 bgu 2005e8c <== NEVER TAKEN 2005e3c: 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); 2005e40: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2005e44: d0 07 20 14 ld [ %i4 + 0x14 ], %o0 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 2005e48: 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); 2005e4c: 90 02 00 01 add %o0, %g1, %o0 2005e50: c2 07 20 18 ld [ %i4 + 0x18 ], %g1 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 2005e54: 40 00 0e 67 call 20097f0 <_Timespec_From_ticks> 2005e58: 90 22 00 01 sub %o0, %g1, %o0 remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND; 2005e5c: c2 07 bf f8 ld [ %fp + -8 ], %g1 remaining += tp.tv_nsec / 1000; 2005e60: 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; 2005e64: b1 28 60 08 sll %g1, 8, %i0 2005e68: 85 28 60 03 sll %g1, 3, %g2 2005e6c: 84 26 00 02 sub %i0, %g2, %g2 remaining += tp.tv_nsec / 1000; 2005e70: 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; 2005e74: b1 28 a0 06 sll %g2, 6, %i0 2005e78: b0 26 00 02 sub %i0, %g2, %i0 remaining += tp.tv_nsec / 1000; 2005e7c: 40 00 37 4f call 2013bb8 <.div> 2005e80: 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; 2005e84: b1 2e 20 06 sll %i0, 6, %i0 remaining += tp.tv_nsec / 1000; 2005e88: b0 02 00 18 add %o0, %i0, %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 ) { 2005e8c: 80 a7 60 00 cmp %i5, 0 2005e90: 02 80 00 19 be 2005ef4 2005e94: 39 00 03 d0 sethi %hi(0xf4000), %i4 Watchdog_Interval ticks; tp.tv_sec = useconds / TOD_MICROSECONDS_PER_SECOND; 2005e98: 90 10 00 1d mov %i5, %o0 2005e9c: 40 00 37 45 call 2013bb0 <.udiv> 2005ea0: 92 17 22 40 or %i4, 0x240, %o1 tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2005ea4: 92 17 22 40 or %i4, 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; 2005ea8: d0 27 bf f8 st %o0, [ %fp + -8 ] tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2005eac: 40 00 37 ed call 2013e60 <.urem> 2005eb0: 90 10 00 1d mov %i5, %o0 2005eb4: 85 2a 20 07 sll %o0, 7, %g2 2005eb8: 83 2a 20 02 sll %o0, 2, %g1 2005ebc: 82 20 80 01 sub %g2, %g1, %g1 2005ec0: 90 00 40 08 add %g1, %o0, %o0 2005ec4: 91 2a 20 03 sll %o0, 3, %o0 2005ec8: d0 27 bf fc st %o0, [ %fp + -4 ] ticks = _Timespec_To_ticks( &tp ); 2005ecc: 40 00 0e 6f call 2009888 <_Timespec_To_ticks> 2005ed0: 90 07 bf f8 add %fp, -8, %o0 if ( ticks == 0 ) ticks = 1; _Watchdog_Insert_ticks( the_timer, _Timespec_To_ticks( &tp ) ); 2005ed4: 40 00 0e 6d call 2009888 <_Timespec_To_ticks> 2005ed8: 90 07 bf f8 add %fp, -8, %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2005edc: 13 00 80 61 sethi %hi(0x2018400), %o1 2005ee0: 92 12 63 c8 or %o1, 0x3c8, %o1 ! 20187c8 <_POSIX_signals_Ualarm_timer> 2005ee4: d0 22 60 0c st %o0, [ %o1 + 0xc ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2005ee8: 11 00 80 5f sethi %hi(0x2017c00), %o0 2005eec: 40 00 0f 56 call 2009c44 <_Watchdog_Insert> 2005ef0: 90 12 23 7c or %o0, 0x37c, %o0 ! 2017f7c <_Watchdog_Ticks_chain> } return remaining; } 2005ef4: 81 c7 e0 08 ret 2005ef8: 81 e8 00 00 restore