=============================================================================== 020090e0 <_CORE_RWLock_Release>: */ CORE_RWLock_Status _CORE_RWLock_Release( CORE_RWLock_Control *the_rwlock ) { 20090e0: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing = _Thread_Executing; 20090e4: 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 ); 20090e8: 7f ff e9 6e call 20036a0 20090ec: fa 00 60 b4 ld [ %g1 + 0xb4 ], %i5 ! 201a0b4 <_Per_CPU_Information+0xc> 20090f0: 84 10 00 08 mov %o0, %g2 if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){ 20090f4: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 20090f8: 80 a0 60 00 cmp %g1, 0 20090fc: 12 80 00 08 bne 200911c <_CORE_RWLock_Release+0x3c> 2009100: 80 a0 60 01 cmp %g1, 1 _ISR_Enable( level ); 2009104: 7f ff e9 6b call 20036b0 2009108: b0 10 20 00 clr %i0 executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; 200910c: 82 10 20 02 mov 2, %g1 2009110: c2 27 60 34 st %g1, [ %i5 + 0x34 ] 2009114: 81 c7 e0 08 ret 2009118: 81 e8 00 00 restore return CORE_RWLOCK_SUCCESSFUL; } if ( the_rwlock->current_state == CORE_RWLOCK_LOCKED_FOR_READING ) { 200911c: 32 80 00 0b bne,a 2009148 <_CORE_RWLock_Release+0x68> 2009120: c0 27 60 34 clr [ %i5 + 0x34 ] the_rwlock->number_of_readers -= 1; 2009124: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 2009128: 82 00 7f ff add %g1, -1, %g1 if ( the_rwlock->number_of_readers != 0 ) { 200912c: 80 a0 60 00 cmp %g1, 0 2009130: 02 80 00 05 be 2009144 <_CORE_RWLock_Release+0x64> 2009134: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* must be unlocked again */ _ISR_Enable( level ); 2009138: 7f ff e9 5e call 20036b0 200913c: b0 10 20 00 clr %i0 return CORE_RWLOCK_SUCCESSFUL; 2009140: 30 80 00 24 b,a 20091d0 <_CORE_RWLock_Release+0xf0> } } /* CORE_RWLOCK_LOCKED_FOR_WRITING or READING with readers */ executing->Wait.return_code = CORE_RWLOCK_SUCCESSFUL; 2009144: 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; 2009148: c0 26 20 44 clr [ %i0 + 0x44 ] _ISR_Enable( level ); 200914c: 7f ff e9 59 call 20036b0 2009150: 90 10 00 02 mov %g2, %o0 next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue ); 2009154: 40 00 07 7e call 200af4c <_Thread_queue_Dequeue> 2009158: 90 10 00 18 mov %i0, %o0 if ( next ) { 200915c: 80 a2 20 00 cmp %o0, 0 2009160: 22 80 00 1c be,a 20091d0 <_CORE_RWLock_Release+0xf0> 2009164: b0 10 20 00 clr %i0 if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) { 2009168: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 200916c: 80 a0 60 01 cmp %g1, 1 2009170: 32 80 00 05 bne,a 2009184 <_CORE_RWLock_Release+0xa4> 2009174: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_WRITING; 2009178: 82 10 20 02 mov 2, %g1 return CORE_RWLOCK_SUCCESSFUL; 200917c: 10 80 00 14 b 20091cc <_CORE_RWLock_Release+0xec> 2009180: c2 26 20 44 st %g1, [ %i0 + 0x44 ] } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 2009184: 82 00 60 01 inc %g1 2009188: c2 26 20 48 st %g1, [ %i0 + 0x48 ] the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_READING; 200918c: 82 10 20 01 mov 1, %g1 2009190: 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 ); 2009194: 40 00 08 aa call 200b43c <_Thread_queue_First> 2009198: 90 10 00 18 mov %i0, %o0 if ( !next || 200919c: 92 92 20 00 orcc %o0, 0, %o1 20091a0: 22 80 00 0c be,a 20091d0 <_CORE_RWLock_Release+0xf0> 20091a4: b0 10 20 00 clr %i0 20091a8: c2 02 60 30 ld [ %o1 + 0x30 ], %g1 20091ac: 80 a0 60 01 cmp %g1, 1 20091b0: 02 80 00 07 be 20091cc <_CORE_RWLock_Release+0xec> <== NEVER TAKEN 20091b4: 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; 20091b8: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 20091bc: 82 00 60 01 inc %g1 _Thread_queue_Extract( &the_rwlock->Wait_queue, next ); 20091c0: 40 00 08 50 call 200b300 <_Thread_queue_Extract> 20091c4: c2 26 20 48 st %g1, [ %i0 + 0x48 ] } 20091c8: 30 bf ff f3 b,a 2009194 <_CORE_RWLock_Release+0xb4> } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 20091cc: b0 10 20 00 clr %i0 20091d0: 81 c7 e0 08 ret 20091d4: 81 e8 00 00 restore =============================================================================== 020091d8 <_CORE_RWLock_Timeout>: void _CORE_RWLock_Timeout( Objects_Id id, void *ignored ) { 20091d8: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 20091dc: 90 10 00 18 mov %i0, %o0 20091e0: 40 00 06 8b call 200ac0c <_Thread_Get> 20091e4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20091e8: c2 07 bf fc ld [ %fp + -4 ], %g1 20091ec: 80 a0 60 00 cmp %g1, 0 20091f0: 12 80 00 09 bne 2009214 <_CORE_RWLock_Timeout+0x3c> <== NEVER TAKEN 20091f4: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 20091f8: 40 00 08 cf call 200b534 <_Thread_queue_Process_timeout> 20091fc: 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--; 2009200: 03 00 80 66 sethi %hi(0x2019800), %g1 2009204: c4 00 63 70 ld [ %g1 + 0x370 ], %g2 ! 2019b70 <_Thread_Dispatch_disable_level> 2009208: 84 00 bf ff add %g2, -1, %g2 200920c: c4 20 63 70 st %g2, [ %g1 + 0x370 ] return _Thread_Dispatch_disable_level; 2009210: c2 00 63 70 ld [ %g1 + 0x370 ], %g1 2009214: 81 c7 e0 08 ret 2009218: 81 e8 00 00 restore =============================================================================== 0200fc34 <_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 ) { 200fc34: 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; 200fc38: f4 26 20 44 st %i2, [ %i0 + 0x44 ] the_message_queue->number_of_pending_messages = 0; 200fc3c: c0 26 20 48 clr [ %i0 + 0x48 ] the_message_queue->maximum_message_size = maximum_message_size; 200fc40: 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; 200fc44: c0 26 20 60 clr [ %i0 + 0x60 ] the_message_queue->notify_argument = the_argument; 200fc48: 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)) { 200fc4c: 80 8e e0 03 btst 3, %i3 200fc50: 02 80 00 07 be 200fc6c <_CORE_message_queue_Initialize+0x38> 200fc54: ba 10 00 1b mov %i3, %i5 allocated_message_size += sizeof(uint32_t); 200fc58: ba 06 e0 04 add %i3, 4, %i5 allocated_message_size &= ~(sizeof(uint32_t) - 1); 200fc5c: ba 0f 7f fc and %i5, -4, %i5 } if (allocated_message_size < maximum_message_size) 200fc60: 80 a7 40 1b cmp %i5, %i3 200fc64: 0a 80 00 24 bcs 200fcf4 <_CORE_message_queue_Initialize+0xc0><== NEVER TAKEN 200fc68: 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( 200fc6c: ba 07 60 14 add %i5, 0x14, %i5 size_t a, size_t b, size_t *c ) { long long x = (long long)a*b; 200fc70: 90 10 20 00 clr %o0 200fc74: 92 10 00 1a mov %i2, %o1 200fc78: 94 10 20 00 clr %o2 200fc7c: 96 10 00 1d mov %i5, %o3 200fc80: 40 00 42 8a call 20206a8 <__muldi3> 200fc84: b8 10 20 00 clr %i4 if ( x > SIZE_MAX ) 200fc88: 80 a2 20 00 cmp %o0, 0 200fc8c: 34 80 00 1b bg,a 200fcf8 <_CORE_message_queue_Initialize+0xc4> 200fc90: 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 ); 200fc94: 40 00 0c 53 call 2012de0 <_Workspace_Allocate> 200fc98: 90 10 00 09 mov %o1, %o0 return false; /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) 200fc9c: d0 26 20 5c st %o0, [ %i0 + 0x5c ] _Workspace_Allocate( message_buffering_required ); if (the_message_queue->message_buffers == 0) 200fca0: 80 a2 20 00 cmp %o0, 0 200fca4: 02 80 00 14 be 200fcf4 <_CORE_message_queue_Initialize+0xc0> 200fca8: 92 10 00 08 mov %o0, %o1 /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 200fcac: 90 06 20 68 add %i0, 0x68, %o0 200fcb0: 94 10 00 1a mov %i2, %o2 200fcb4: 40 00 16 27 call 2015550 <_Chain_Initialize> 200fcb8: 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 ); 200fcbc: 82 06 20 50 add %i0, 0x50, %g1 head->next = tail; head->previous = NULL; tail->previous = head; 200fcc0: 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( 200fcc4: 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 ); 200fcc8: 84 06 20 54 add %i0, 0x54, %g2 200fccc: 82 18 60 01 xor %g1, 1, %g1 200fcd0: 80 a0 00 01 cmp %g0, %g1 head->next = tail; 200fcd4: c4 26 20 50 st %g2, [ %i0 + 0x50 ] head->previous = NULL; 200fcd8: c0 26 20 54 clr [ %i0 + 0x54 ] 200fcdc: 90 10 00 18 mov %i0, %o0 200fce0: 92 60 3f ff subx %g0, -1, %o1 200fce4: 94 10 20 80 mov 0x80, %o2 200fce8: 96 10 20 06 mov 6, %o3 200fcec: 40 00 09 e3 call 2012478 <_Thread_queue_Initialize> 200fcf0: b8 10 20 01 mov 1, %i4 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 200fcf4: b0 0f 20 01 and %i4, 1, %i0 200fcf8: 81 c7 e0 08 ret 200fcfc: 81 e8 00 00 restore =============================================================================== 020072d0 <_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 ) { 20072d0: 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)) ) { 20072d4: 90 10 00 18 mov %i0, %o0 20072d8: 40 00 07 5b call 2009044 <_Thread_queue_Dequeue> 20072dc: ba 10 00 18 mov %i0, %i5 20072e0: 80 a2 20 00 cmp %o0, 0 20072e4: 12 80 00 0e bne 200731c <_CORE_semaphore_Surrender+0x4c> 20072e8: 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 ); 20072ec: 7f ff eb a4 call 200217c 20072f0: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 20072f4: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 20072f8: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 20072fc: 80 a0 40 02 cmp %g1, %g2 2007300: 1a 80 00 05 bcc 2007314 <_CORE_semaphore_Surrender+0x44> <== NEVER TAKEN 2007304: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 2007308: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 200730c: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 2007310: c2 27 60 48 st %g1, [ %i5 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 2007314: 7f ff eb 9e call 200218c 2007318: 01 00 00 00 nop } return status; } 200731c: 81 c7 e0 08 ret 2007320: 81 e8 00 00 restore =============================================================================== 02005ff8 <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 2005ff8: 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 ]; 2005ffc: f8 06 21 58 ld [ %i0 + 0x158 ], %i4 option_set = (rtems_option) the_thread->Wait.option; 2006000: f6 06 20 30 ld [ %i0 + 0x30 ], %i3 _ISR_Disable( level ); 2006004: 7f ff f0 5e call 200217c 2006008: ba 10 00 18 mov %i0, %i5 200600c: b0 10 00 08 mov %o0, %i0 pending_events = api->pending_events; 2006010: c4 07 00 00 ld [ %i4 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 2006014: 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 ) ) { 2006018: 82 88 c0 02 andcc %g3, %g2, %g1 200601c: 02 80 00 43 be 2006128 <_Event_Surrender+0x130> 2006020: 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() && 2006024: 09 00 80 73 sethi %hi(0x201cc00), %g4 2006028: 88 11 22 f8 or %g4, 0x2f8, %g4 ! 201cef8 <_Per_CPU_Information> 200602c: f2 01 20 08 ld [ %g4 + 8 ], %i1 2006030: 80 a6 60 00 cmp %i1, 0 2006034: 22 80 00 1d be,a 20060a8 <_Event_Surrender+0xb0> 2006038: c8 07 60 10 ld [ %i5 + 0x10 ], %g4 200603c: c8 01 20 0c ld [ %g4 + 0xc ], %g4 2006040: 80 a7 40 04 cmp %i5, %g4 2006044: 32 80 00 19 bne,a 20060a8 <_Event_Surrender+0xb0> 2006048: c8 07 60 10 ld [ %i5 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 200604c: 09 00 80 74 sethi %hi(0x201d000), %g4 2006050: f2 01 22 f0 ld [ %g4 + 0x2f0 ], %i1 ! 201d2f0 <_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 ) && 2006054: 80 a6 60 02 cmp %i1, 2 2006058: 02 80 00 07 be 2006074 <_Event_Surrender+0x7c> <== NEVER TAKEN 200605c: 80 a0 40 03 cmp %g1, %g3 ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 2006060: c8 01 22 f0 ld [ %g4 + 0x2f0 ], %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) || 2006064: 80 a1 20 01 cmp %g4, 1 2006068: 32 80 00 10 bne,a 20060a8 <_Event_Surrender+0xb0> 200606c: 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) ) { 2006070: 80 a0 40 03 cmp %g1, %g3 2006074: 02 80 00 04 be 2006084 <_Event_Surrender+0x8c> 2006078: 80 8e e0 02 btst 2, %i3 200607c: 02 80 00 2b be 2006128 <_Event_Surrender+0x130> <== NEVER TAKEN 2006080: 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) ); 2006084: 84 28 80 01 andn %g2, %g1, %g2 api->pending_events = _Event_sets_Clear( pending_events,seized_events ); 2006088: c4 27 00 00 st %g2, [ %i4 ] the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 200608c: 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; 2006090: c0 27 60 24 clr [ %i5 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2006094: c2 20 80 00 st %g1, [ %g2 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 2006098: 84 10 20 03 mov 3, %g2 200609c: 03 00 80 74 sethi %hi(0x201d000), %g1 20060a0: c4 20 62 f0 st %g2, [ %g1 + 0x2f0 ] ! 201d2f0 <_Event_Sync_state> 20060a4: 30 80 00 21 b,a 2006128 <_Event_Surrender+0x130> } /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { 20060a8: 80 89 21 00 btst 0x100, %g4 20060ac: 02 80 00 1f be 2006128 <_Event_Surrender+0x130> 20060b0: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 20060b4: 02 80 00 04 be 20060c4 <_Event_Surrender+0xcc> 20060b8: 80 8e e0 02 btst 2, %i3 20060bc: 02 80 00 1b be 2006128 <_Event_Surrender+0x130> <== NEVER TAKEN 20060c0: 01 00 00 00 nop 20060c4: 84 28 80 01 andn %g2, %g1, %g2 api->pending_events = _Event_sets_Clear( pending_events, seized_events ); 20060c8: c4 27 00 00 st %g2, [ %i4 ] the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20060cc: 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; 20060d0: c0 27 60 24 clr [ %i5 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 20060d4: c2 20 80 00 st %g1, [ %g2 ] _ISR_Flash( level ); 20060d8: 7f ff f0 2d call 200218c 20060dc: 90 10 00 18 mov %i0, %o0 20060e0: 7f ff f0 27 call 200217c 20060e4: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 20060e8: c2 07 60 50 ld [ %i5 + 0x50 ], %g1 20060ec: 80 a0 60 02 cmp %g1, 2 20060f0: 02 80 00 06 be 2006108 <_Event_Surrender+0x110> 20060f4: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 20060f8: 7f ff f0 25 call 200218c 20060fc: 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 ); 2006100: 10 80 00 08 b 2006120 <_Event_Surrender+0x128> 2006104: 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; 2006108: c2 27 60 50 st %g1, [ %i5 + 0x50 ] _Thread_Unblock( the_thread ); } else { _Watchdog_Deactivate( &the_thread->Timer ); _ISR_Enable( level ); 200610c: 7f ff f0 20 call 200218c 2006110: 33 04 00 ff sethi %hi(0x1003fc00), %i1 (void) _Watchdog_Remove( &the_thread->Timer ); 2006114: 40 00 0e bf call 2009c10 <_Watchdog_Remove> 2006118: 90 07 60 48 add %i5, 0x48, %o0 200611c: b2 16 63 f8 or %i1, 0x3f8, %i1 2006120: 40 00 0a 0e call 2008958 <_Thread_Clear_state> 2006124: 91 e8 00 1d restore %g0, %i5, %o0 _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 2006128: 7f ff f0 19 call 200218c 200612c: 81 e8 00 00 restore =============================================================================== 02006130 <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 2006130: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 2006134: 90 10 00 18 mov %i0, %o0 2006138: 40 00 0a f3 call 2008d04 <_Thread_Get> 200613c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2006140: c2 07 bf fc ld [ %fp + -4 ], %g1 2006144: 80 a0 60 00 cmp %g1, 0 2006148: 12 80 00 1d bne 20061bc <_Event_Timeout+0x8c> <== NEVER TAKEN 200614c: 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 ); 2006150: 7f ff f0 0b call 200217c 2006154: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 2006158: 03 00 80 73 sethi %hi(0x201cc00), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 200615c: c2 00 63 04 ld [ %g1 + 0x304 ], %g1 ! 201cf04 <_Per_CPU_Information+0xc> 2006160: 80 a7 40 01 cmp %i5, %g1 2006164: 12 80 00 09 bne 2006188 <_Event_Timeout+0x58> 2006168: c0 27 60 24 clr [ %i5 + 0x24 ] if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) 200616c: 03 00 80 74 sethi %hi(0x201d000), %g1 2006170: c4 00 62 f0 ld [ %g1 + 0x2f0 ], %g2 ! 201d2f0 <_Event_Sync_state> 2006174: 80 a0 a0 01 cmp %g2, 1 2006178: 32 80 00 05 bne,a 200618c <_Event_Timeout+0x5c> 200617c: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 2006180: 84 10 20 02 mov 2, %g2 2006184: c4 20 62 f0 st %g2, [ %g1 + 0x2f0 ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 2006188: 82 10 20 06 mov 6, %g1 200618c: c2 27 60 34 st %g1, [ %i5 + 0x34 ] _ISR_Enable( level ); 2006190: 7f ff ef ff call 200218c 2006194: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2006198: 90 10 00 1d mov %i5, %o0 200619c: 13 04 00 ff sethi %hi(0x1003fc00), %o1 20061a0: 40 00 09 ee call 2008958 <_Thread_Clear_state> 20061a4: 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--; 20061a8: 03 00 80 72 sethi %hi(0x201c800), %g1 20061ac: c4 00 61 c0 ld [ %g1 + 0x1c0 ], %g2 ! 201c9c0 <_Thread_Dispatch_disable_level> 20061b0: 84 00 bf ff add %g2, -1, %g2 20061b4: c4 20 61 c0 st %g2, [ %g1 + 0x1c0 ] return _Thread_Dispatch_disable_level; 20061b8: c2 00 61 c0 ld [ %g1 + 0x1c0 ], %g1 20061bc: 81 c7 e0 08 ret 20061c0: 81 e8 00 00 restore =============================================================================== 0200c530 <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 200c530: 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; 200c534: c0 27 bf f8 clr [ %fp + -8 ] Heap_Block *extend_last_block = NULL; 200c538: 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; 200c53c: 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; 200c540: 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; 200c544: e2 06 20 10 ld [ %i0 + 0x10 ], %l1 uintptr_t const min_block_size = heap->min_block_size; 200c548: 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; 200c54c: 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 ) { 200c550: 80 a7 40 19 cmp %i5, %i1 200c554: 0a 80 00 9f bcs 200c7d0 <_Heap_Extend+0x2a0> 200c558: b8 10 20 00 clr %i4 return false; } extend_area_ok = _Heap_Get_first_and_last_block( 200c55c: 90 10 00 19 mov %i1, %o0 200c560: 92 10 00 1a mov %i2, %o1 200c564: 94 10 00 11 mov %l1, %o2 200c568: 98 07 bf f8 add %fp, -8, %o4 200c56c: 7f ff eb 2c call 200721c <_Heap_Get_first_and_last_block> 200c570: 9a 07 bf fc add %fp, -4, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 200c574: 80 8a 20 ff btst 0xff, %o0 200c578: 02 80 00 96 be 200c7d0 <_Heap_Extend+0x2a0> 200c57c: b4 10 00 10 mov %l0, %i2 200c580: aa 10 20 00 clr %l5 200c584: ac 10 20 00 clr %l6 200c588: b8 10 20 00 clr %i4 200c58c: a8 10 20 00 clr %l4 200c590: 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 ( 200c594: 80 a0 40 1d cmp %g1, %i5 200c598: 1a 80 00 05 bcc 200c5ac <_Heap_Extend+0x7c> 200c59c: e6 06 80 00 ld [ %i2 ], %l3 200c5a0: 80 a6 40 13 cmp %i1, %l3 200c5a4: 2a 80 00 8b bcs,a 200c7d0 <_Heap_Extend+0x2a0> 200c5a8: 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 ) { 200c5ac: 80 a7 40 01 cmp %i5, %g1 200c5b0: 02 80 00 06 be 200c5c8 <_Heap_Extend+0x98> 200c5b4: 80 a7 40 13 cmp %i5, %l3 merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { 200c5b8: 2a 80 00 05 bcs,a 200c5cc <_Heap_Extend+0x9c> 200c5bc: ac 10 00 1a mov %i2, %l6 200c5c0: 10 80 00 04 b 200c5d0 <_Heap_Extend+0xa0> 200c5c4: 90 10 00 13 mov %l3, %o0 200c5c8: a8 10 00 1a mov %i2, %l4 200c5cc: 90 10 00 13 mov %l3, %o0 200c5d0: 40 00 17 28 call 2012270 <.urem> 200c5d4: 92 10 00 11 mov %l1, %o1 200c5d8: ae 04 ff f8 add %l3, -8, %l7 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200c5dc: 80 a4 c0 19 cmp %l3, %i1 200c5e0: 12 80 00 05 bne 200c5f4 <_Heap_Extend+0xc4> 200c5e4: 90 25 c0 08 sub %l7, %o0, %o0 start_block->prev_size = extend_area_end; 200c5e8: 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 ) 200c5ec: 10 80 00 04 b 200c5fc <_Heap_Extend+0xcc> 200c5f0: b8 10 00 08 mov %o0, %i4 merge_above_block = end_block; } else if ( sub_area_end < extend_area_begin ) { 200c5f4: 2a 80 00 02 bcs,a 200c5fc <_Heap_Extend+0xcc> 200c5f8: 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; 200c5fc: f4 02 20 04 ld [ %o0 + 4 ], %i2 200c600: 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); 200c604: 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 ); 200c608: 80 a6 80 10 cmp %i2, %l0 200c60c: 12 bf ff e2 bne 200c594 <_Heap_Extend+0x64> 200c610: 82 10 00 1a mov %i2, %g1 if ( extend_area_begin < heap->area_begin ) { 200c614: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200c618: 80 a6 40 01 cmp %i1, %g1 200c61c: 3a 80 00 04 bcc,a 200c62c <_Heap_Extend+0xfc> 200c620: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 200c624: 10 80 00 05 b 200c638 <_Heap_Extend+0x108> 200c628: f2 26 20 18 st %i1, [ %i0 + 0x18 ] } else if ( heap->area_end < extend_area_end ) { 200c62c: 80 a0 40 1d cmp %g1, %i5 200c630: 2a 80 00 02 bcs,a 200c638 <_Heap_Extend+0x108> 200c634: 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; 200c638: c4 07 bf f8 ld [ %fp + -8 ], %g2 200c63c: c2 07 bf fc ld [ %fp + -4 ], %g1 extend_first_block->prev_size = extend_area_end; 200c640: 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 = 200c644: 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; 200c648: 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; 200c64c: 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 = 200c650: 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 ) { 200c654: c6 06 20 20 ld [ %i0 + 0x20 ], %g3 200c658: 80 a0 c0 02 cmp %g3, %g2 200c65c: 08 80 00 04 bleu 200c66c <_Heap_Extend+0x13c> 200c660: c0 20 60 04 clr [ %g1 + 4 ] heap->first_block = extend_first_block; 200c664: 10 80 00 06 b 200c67c <_Heap_Extend+0x14c> 200c668: c4 26 20 20 st %g2, [ %i0 + 0x20 ] } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { 200c66c: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 200c670: 80 a0 80 01 cmp %g2, %g1 200c674: 2a 80 00 02 bcs,a 200c67c <_Heap_Extend+0x14c> 200c678: c2 26 20 24 st %g1, [ %i0 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200c67c: 80 a5 20 00 cmp %l4, 0 200c680: 02 80 00 14 be 200c6d0 <_Heap_Extend+0x1a0> 200c684: 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; 200c688: 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; 200c68c: 92 10 00 1a mov %i2, %o1 200c690: 40 00 16 f8 call 2012270 <.urem> 200c694: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 200c698: 80 a2 20 00 cmp %o0, 0 200c69c: 02 80 00 04 be 200c6ac <_Heap_Extend+0x17c> 200c6a0: c2 05 00 00 ld [ %l4 ], %g1 return value - remainder + alignment; 200c6a4: b2 06 40 1a add %i1, %i2, %i1 200c6a8: 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 = 200c6ac: 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; 200c6b0: 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 = 200c6b4: 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; 200c6b8: 82 10 60 01 or %g1, 1, %g1 _Heap_Free_block( heap, new_first_block ); 200c6bc: 90 10 00 18 mov %i0, %o0 200c6c0: 7f ff ff 92 call 200c508 <_Heap_Free_block> 200c6c4: c2 22 60 04 st %g1, [ %o1 + 4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200c6c8: 10 80 00 08 b 200c6e8 <_Heap_Extend+0x1b8> 200c6cc: 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 ) { 200c6d0: 80 a5 a0 00 cmp %l6, 0 200c6d4: 02 80 00 04 be 200c6e4 <_Heap_Extend+0x1b4> 200c6d8: 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; 200c6dc: 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 = 200c6e0: ec 20 60 04 st %l6, [ %g1 + 4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200c6e4: 80 a7 20 00 cmp %i4, 0 200c6e8: 02 80 00 15 be 200c73c <_Heap_Extend+0x20c> 200c6ec: 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); 200c6f0: 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( 200c6f4: ba 27 40 1c sub %i5, %i4, %i5 200c6f8: 40 00 16 de call 2012270 <.urem> 200c6fc: 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) 200c700: c4 07 20 04 ld [ %i4 + 4 ], %g2 200c704: 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 = 200c708: 82 07 40 1c add %i5, %i4, %g1 (last_block->size_and_flag - last_block_new_size) 200c70c: 84 20 80 1d sub %g2, %i5, %g2 | HEAP_PREV_BLOCK_USED; 200c710: 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 = 200c714: 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; 200c718: 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 ); 200c71c: 90 10 00 18 mov %i0, %o0 200c720: 82 08 60 01 and %g1, 1, %g1 200c724: 92 10 00 1c mov %i4, %o1 block->size_and_flag = size | flag; 200c728: ba 17 40 01 or %i5, %g1, %i5 200c72c: 7f ff ff 77 call 200c508 <_Heap_Free_block> 200c730: fa 27 20 04 st %i5, [ %i4 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200c734: 10 80 00 0f b 200c770 <_Heap_Extend+0x240> 200c738: 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 ) { 200c73c: 80 a5 60 00 cmp %l5, 0 200c740: 02 80 00 0b be 200c76c <_Heap_Extend+0x23c> 200c744: 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; 200c748: c6 05 60 04 ld [ %l5 + 4 ], %g3 _Heap_Link_above( 200c74c: c2 07 bf fc ld [ %fp + -4 ], %g1 200c750: 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 ); 200c754: 84 20 80 15 sub %g2, %l5, %g2 block->size_and_flag = size | flag; 200c758: 84 10 c0 02 or %g3, %g2, %g2 200c75c: c4 25 60 04 st %g2, [ %l5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 200c760: c4 00 60 04 ld [ %g1 + 4 ], %g2 200c764: 84 10 a0 01 or %g2, 1, %g2 200c768: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200c76c: 80 a7 20 00 cmp %i4, 0 200c770: 32 80 00 09 bne,a 200c794 <_Heap_Extend+0x264> 200c774: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200c778: 80 a5 20 00 cmp %l4, 0 200c77c: 32 80 00 06 bne,a 200c794 <_Heap_Extend+0x264> 200c780: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 200c784: d2 07 bf f8 ld [ %fp + -8 ], %o1 200c788: 7f ff ff 60 call 200c508 <_Heap_Free_block> 200c78c: 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 200c790: 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( 200c794: 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; 200c798: 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( 200c79c: 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; 200c7a0: 86 08 e0 01 and %g3, 1, %g3 block->size_and_flag = size | flag; 200c7a4: 84 10 c0 02 or %g3, %g2, %g2 200c7a8: c4 20 60 04 st %g2, [ %g1 + 4 ] } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200c7ac: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 stats->size += extended_size; if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; 200c7b0: 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; 200c7b4: a4 20 40 12 sub %g1, %l2, %l2 /* Statistics */ stats->size += extended_size; 200c7b8: c2 06 20 2c ld [ %i0 + 0x2c ], %g1 if ( extended_size_ptr != NULL ) 200c7bc: 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; 200c7c0: 82 00 40 12 add %g1, %l2, %g1 if ( extended_size_ptr != NULL ) 200c7c4: 02 80 00 03 be 200c7d0 <_Heap_Extend+0x2a0> <== NEVER TAKEN 200c7c8: c2 26 20 2c st %g1, [ %i0 + 0x2c ] 200c7cc: e4 26 c0 00 st %l2, [ %i3 ] *extended_size_ptr = extended_size; return true; } 200c7d0: b0 0f 20 01 and %i4, 1, %i0 200c7d4: 81 c7 e0 08 ret 200c7d8: 81 e8 00 00 restore =============================================================================== 0200c940 <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200c940: 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; 200c944: 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 ) { 200c948: 80 a6 60 00 cmp %i1, 0 200c94c: 02 80 00 77 be 200cb28 <_Heap_Free+0x1e8> 200c950: 90 10 00 19 mov %i1, %o0 200c954: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200c958: 40 00 2c 51 call 2017a9c <.urem> 200c95c: 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 200c960: 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); 200c964: 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; 200c968: 80 a7 40 0d cmp %i5, %o5 200c96c: 0a 80 00 05 bcs 200c980 <_Heap_Free+0x40> 200c970: 82 10 20 00 clr %g1 200c974: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200c978: 80 a0 40 1d cmp %g1, %i5 200c97c: 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 ) ) { 200c980: 80 a0 60 00 cmp %g1, 0 200c984: 02 80 00 69 be 200cb28 <_Heap_Free+0x1e8> 200c988: 88 10 20 00 clr %g4 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200c98c: 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; 200c990: 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); 200c994: 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; 200c998: 80 a0 40 0d cmp %g1, %o5 200c99c: 0a 80 00 05 bcs 200c9b0 <_Heap_Free+0x70> <== NEVER TAKEN 200c9a0: 86 10 20 00 clr %g3 200c9a4: c6 06 20 24 ld [ %i0 + 0x24 ], %g3 200c9a8: 80 a0 c0 01 cmp %g3, %g1 200c9ac: 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 ) ) { 200c9b0: 80 a0 e0 00 cmp %g3, 0 200c9b4: 02 80 00 5d be 200cb28 <_Heap_Free+0x1e8> <== NEVER TAKEN 200c9b8: 88 10 20 00 clr %g4 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200c9bc: de 00 60 04 ld [ %g1 + 4 ], %o7 return false; } _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_prev_used( next_block ) ) { 200c9c0: 80 8b e0 01 btst 1, %o7 200c9c4: 02 80 00 59 be 200cb28 <_Heap_Free+0x1e8> <== NEVER TAKEN 200c9c8: 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 200c9cc: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); 200c9d0: 80 a0 40 04 cmp %g1, %g4 200c9d4: 02 80 00 07 be 200c9f0 <_Heap_Free+0xb0> 200c9d8: 98 10 20 00 clr %o4 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200c9dc: 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; 200c9e0: c6 00 e0 04 ld [ %g3 + 4 ], %g3 200c9e4: 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 )); 200c9e8: 80 a0 00 03 cmp %g0, %g3 200c9ec: 98 60 3f ff subx %g0, -1, %o4 if ( !_Heap_Is_prev_used( block ) ) { 200c9f0: 80 8a e0 01 btst 1, %o3 200c9f4: 12 80 00 25 bne 200ca88 <_Heap_Free+0x148> 200c9f8: 80 8b 20 ff btst 0xff, %o4 uintptr_t const prev_size = block->prev_size; 200c9fc: 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); 200ca00: 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; 200ca04: 80 a0 c0 0d cmp %g3, %o5 200ca08: 0a 80 00 04 bcs 200ca18 <_Heap_Free+0xd8> <== NEVER TAKEN 200ca0c: 94 10 20 00 clr %o2 200ca10: 80 a1 00 03 cmp %g4, %g3 200ca14: 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 ) ) { 200ca18: 80 a2 a0 00 cmp %o2, 0 200ca1c: 02 80 00 43 be 200cb28 <_Heap_Free+0x1e8> <== NEVER TAKEN 200ca20: 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; 200ca24: 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) ) { 200ca28: 80 8b 60 01 btst 1, %o5 200ca2c: 02 80 00 3f be 200cb28 <_Heap_Free+0x1e8> <== NEVER TAKEN 200ca30: 80 8b 20 ff btst 0xff, %o4 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200ca34: 02 80 00 0e be 200ca6c <_Heap_Free+0x12c> 200ca38: 88 00 80 0b add %g2, %o3, %g4 uintptr_t const size = block_size + prev_size + next_block_size; 200ca3c: 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; 200ca40: c8 00 60 08 ld [ %g1 + 8 ], %g4 Heap_Block *prev = block->prev; 200ca44: c2 00 60 0c ld [ %g1 + 0xc ], %g1 prev->next = next; 200ca48: c8 20 60 08 st %g4, [ %g1 + 8 ] next->prev = prev; 200ca4c: c2 21 20 0c st %g1, [ %g4 + 0xc ] _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; 200ca50: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 200ca54: 82 00 7f ff add %g1, -1, %g1 200ca58: 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; 200ca5c: 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; 200ca60: 82 13 e0 01 or %o7, 1, %g1 200ca64: 10 80 00 27 b 200cb00 <_Heap_Free+0x1c0> 200ca68: 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; 200ca6c: 9e 11 20 01 or %g4, 1, %o7 200ca70: de 20 e0 04 st %o7, [ %g3 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200ca74: c6 00 60 04 ld [ %g1 + 4 ], %g3 next_block->prev_size = size; 200ca78: 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; 200ca7c: 86 08 ff fe and %g3, -2, %g3 200ca80: 10 80 00 20 b 200cb00 <_Heap_Free+0x1c0> 200ca84: c6 20 60 04 st %g3, [ %g1 + 4 ] next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ 200ca88: 22 80 00 0d be,a 200cabc <_Heap_Free+0x17c> 200ca8c: 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; 200ca90: c8 00 60 08 ld [ %g1 + 8 ], %g4 Heap_Block *prev = old_block->prev; 200ca94: c2 00 60 0c ld [ %g1 + 0xc ], %g1 new_block->next = next; 200ca98: c8 27 60 08 st %g4, [ %i5 + 8 ] new_block->prev = prev; 200ca9c: c2 27 60 0c st %g1, [ %i5 + 0xc ] uintptr_t const size = block_size + next_block_size; 200caa0: 86 03 c0 02 add %o7, %g2, %g3 next->prev = new_block; prev->next = new_block; 200caa4: 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; 200caa8: fa 21 20 0c st %i5, [ %g4 + 0xc ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200caac: 82 10 e0 01 or %g3, 1, %g1 next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200cab0: 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; 200cab4: 10 80 00 13 b 200cb00 <_Heap_Free+0x1c0> 200cab8: c2 27 60 04 st %g1, [ %i5 + 4 ] ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 200cabc: f0 27 60 0c st %i0, [ %i5 + 0xc ] Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 200cac0: c6 27 60 08 st %g3, [ %i5 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 200cac4: 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; 200cac8: 86 10 a0 01 or %g2, 1, %g3 200cacc: c6 27 60 04 st %g3, [ %i5 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200cad0: c6 00 60 04 ld [ %g1 + 4 ], %g3 next_block->prev_size = block_size; 200cad4: 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; 200cad8: 86 08 ff fe and %g3, -2, %g3 200cadc: c6 20 60 04 st %g3, [ %g1 + 4 ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200cae0: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 if ( stats->max_free_blocks < stats->free_blocks ) { 200cae4: 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; 200cae8: 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; 200caec: fa 26 20 08 st %i5, [ %i0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 200caf0: 80 a0 c0 01 cmp %g3, %g1 200caf4: 1a 80 00 03 bcc 200cb00 <_Heap_Free+0x1c0> 200caf8: c2 26 20 38 st %g1, [ %i0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 200cafc: c2 26 20 3c st %g1, [ %i0 + 0x3c ] } } /* Statistics */ --stats->used_blocks; 200cb00: c2 06 20 40 ld [ %i0 + 0x40 ], %g1 ++stats->frees; stats->free_size += block_size; return( true ); 200cb04: 88 10 20 01 mov 1, %g4 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200cb08: 82 00 7f ff add %g1, -1, %g1 200cb0c: c2 26 20 40 st %g1, [ %i0 + 0x40 ] ++stats->frees; 200cb10: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 200cb14: 82 00 60 01 inc %g1 200cb18: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->free_size += block_size; 200cb1c: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 200cb20: 84 00 40 02 add %g1, %g2, %g2 200cb24: c4 26 20 30 st %g2, [ %i0 + 0x30 ] return( true ); } 200cb28: b0 09 20 01 and %g4, 1, %i0 200cb2c: 81 c7 e0 08 ret 200cb30: 81 e8 00 00 restore =============================================================================== 02019ac4 <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 2019ac4: 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); 2019ac8: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 2019acc: 7f ff f7 f4 call 2017a9c <.urem> 2019ad0: 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 2019ad4: 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); 2019ad8: 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); 2019adc: 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; 2019ae0: 80 a2 00 03 cmp %o0, %g3 2019ae4: 0a 80 00 05 bcs 2019af8 <_Heap_Size_of_alloc_area+0x34> 2019ae8: 84 10 20 00 clr %g2 2019aec: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 2019af0: 80 a0 40 08 cmp %g1, %o0 2019af4: 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 ) ) { 2019af8: 80 a0 a0 00 cmp %g2, 0 2019afc: 02 80 00 15 be 2019b50 <_Heap_Size_of_alloc_area+0x8c> 2019b00: 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; 2019b04: fa 02 20 04 ld [ %o0 + 4 ], %i5 2019b08: 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); 2019b0c: 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; 2019b10: 80 a7 40 03 cmp %i5, %g3 2019b14: 0a 80 00 05 bcs 2019b28 <_Heap_Size_of_alloc_area+0x64> <== NEVER TAKEN 2019b18: 84 10 20 00 clr %g2 2019b1c: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 2019b20: 80 a0 40 1d cmp %g1, %i5 2019b24: 84 60 3f ff subx %g0, -1, %g2 } block_size = _Heap_Block_size( block ); next_block = _Heap_Block_at( block, block_size ); if ( 2019b28: 80 a0 a0 00 cmp %g2, 0 2019b2c: 02 80 00 09 be 2019b50 <_Heap_Size_of_alloc_area+0x8c> <== NEVER TAKEN 2019b30: 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; 2019b34: c4 07 60 04 ld [ %i5 + 4 ], %g2 !_Heap_Is_block_in_heap( heap, next_block ) || !_Heap_Is_prev_used( next_block ) 2019b38: 80 88 a0 01 btst 1, %g2 2019b3c: 02 80 00 05 be 2019b50 <_Heap_Size_of_alloc_area+0x8c> <== NEVER TAKEN 2019b40: ba 27 40 19 sub %i5, %i1, %i5 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 2019b44: 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; 2019b48: ba 07 60 04 add %i5, 4, %i5 2019b4c: fa 26 80 00 st %i5, [ %i2 ] return true; } 2019b50: b0 08 60 01 and %g1, 1, %i0 2019b54: 81 c7 e0 08 ret 2019b58: 81 e8 00 00 restore =============================================================================== 02008118 <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 2008118: 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; 200811c: 3b 00 80 20 sethi %hi(0x2008000), %i5 Heap_Control *heap, int source, bool dump ) { uintptr_t const page_size = heap->page_size; 2008120: f8 06 20 10 ld [ %i0 + 0x10 ], %i4 uintptr_t const min_block_size = heap->min_block_size; 2008124: e0 06 20 14 ld [ %i0 + 0x14 ], %l0 Heap_Block *const first_block = heap->first_block; 2008128: f6 06 20 20 ld [ %i0 + 0x20 ], %i3 Heap_Block *const last_block = heap->last_block; 200812c: 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; 2008130: 80 a6 a0 00 cmp %i2, 0 2008134: 02 80 00 04 be 2008144 <_Heap_Walk+0x2c> 2008138: ba 17 60 c4 or %i5, 0xc4, %i5 200813c: 3b 00 80 20 sethi %hi(0x2008000), %i5 2008140: ba 17 60 cc or %i5, 0xcc, %i5 ! 20080cc <_Heap_Walk_print> if ( !_System_state_Is_up( _System_state_Get() ) ) { 2008144: 03 00 80 60 sethi %hi(0x2018000), %g1 2008148: c4 00 63 a4 ld [ %g1 + 0x3a4 ], %g2 ! 20183a4 <_System_state_Current> 200814c: 80 a0 a0 03 cmp %g2, 3 2008150: 12 80 01 24 bne 20085e0 <_Heap_Walk+0x4c8> 2008154: 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)( 2008158: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 200815c: da 06 20 18 ld [ %i0 + 0x18 ], %o5 2008160: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2008164: f6 23 a0 60 st %i3, [ %sp + 0x60 ] 2008168: e2 23 a0 64 st %l1, [ %sp + 0x64 ] 200816c: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008170: 90 10 00 19 mov %i1, %o0 2008174: c2 23 a0 68 st %g1, [ %sp + 0x68 ] 2008178: c2 06 20 0c ld [ %i0 + 0xc ], %g1 200817c: 92 10 20 00 clr %o1 2008180: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2008184: 15 00 80 55 sethi %hi(0x2015400), %o2 2008188: 96 10 00 1c mov %i4, %o3 200818c: 94 12 a3 10 or %o2, 0x310, %o2 2008190: 9f c7 40 00 call %i5 2008194: 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 ) { 2008198: 80 a7 20 00 cmp %i4, 0 200819c: 12 80 00 07 bne 20081b8 <_Heap_Walk+0xa0> 20081a0: 80 8f 20 07 btst 7, %i4 (*printer)( source, true, "page size is zero\n" ); 20081a4: 15 00 80 55 sethi %hi(0x2015400), %o2 20081a8: 90 10 00 19 mov %i1, %o0 20081ac: 92 10 20 01 mov 1, %o1 20081b0: 10 80 00 32 b 2008278 <_Heap_Walk+0x160> 20081b4: 94 12 a3 a8 or %o2, 0x3a8, %o2 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 20081b8: 22 80 00 08 be,a 20081d8 <_Heap_Walk+0xc0> 20081bc: 90 10 00 10 mov %l0, %o0 (*printer)( 20081c0: 15 00 80 55 sethi %hi(0x2015400), %o2 20081c4: 90 10 00 19 mov %i1, %o0 20081c8: 92 10 20 01 mov 1, %o1 20081cc: 94 12 a3 c0 or %o2, 0x3c0, %o2 20081d0: 10 80 01 0b b 20085fc <_Heap_Walk+0x4e4> 20081d4: 96 10 00 1c mov %i4, %o3 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 20081d8: 7f ff e6 42 call 2001ae0 <.urem> 20081dc: 92 10 00 1c mov %i4, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 20081e0: 80 a2 20 00 cmp %o0, 0 20081e4: 22 80 00 08 be,a 2008204 <_Heap_Walk+0xec> 20081e8: 90 06 e0 08 add %i3, 8, %o0 (*printer)( 20081ec: 15 00 80 55 sethi %hi(0x2015400), %o2 20081f0: 90 10 00 19 mov %i1, %o0 20081f4: 92 10 20 01 mov 1, %o1 20081f8: 94 12 a3 e0 or %o2, 0x3e0, %o2 20081fc: 10 80 01 00 b 20085fc <_Heap_Walk+0x4e4> 2008200: 96 10 00 10 mov %l0, %o3 2008204: 7f ff e6 37 call 2001ae0 <.urem> 2008208: 92 10 00 1c mov %i4, %o1 ); return false; } if ( 200820c: 80 a2 20 00 cmp %o0, 0 2008210: 22 80 00 08 be,a 2008230 <_Heap_Walk+0x118> 2008214: c2 06 e0 04 ld [ %i3 + 4 ], %g1 !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 2008218: 15 00 80 56 sethi %hi(0x2015800), %o2 200821c: 90 10 00 19 mov %i1, %o0 2008220: 92 10 20 01 mov 1, %o1 2008224: 94 12 a0 08 or %o2, 8, %o2 2008228: 10 80 00 f5 b 20085fc <_Heap_Walk+0x4e4> 200822c: 96 10 00 1b mov %i3, %o3 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 2008230: 80 88 60 01 btst 1, %g1 2008234: 32 80 00 07 bne,a 2008250 <_Heap_Walk+0x138> 2008238: f4 04 60 04 ld [ %l1 + 4 ], %i2 (*printer)( 200823c: 15 00 80 56 sethi %hi(0x2015800), %o2 2008240: 90 10 00 19 mov %i1, %o0 2008244: 92 10 20 01 mov 1, %o1 2008248: 10 80 00 0c b 2008278 <_Heap_Walk+0x160> 200824c: 94 12 a0 40 or %o2, 0x40, %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; 2008250: 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); 2008254: 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; 2008258: c2 06 a0 04 ld [ %i2 + 4 ], %g1 ); return false; } if ( _Heap_Is_free( last_block ) ) { 200825c: 80 88 60 01 btst 1, %g1 2008260: 12 80 00 0a bne 2008288 <_Heap_Walk+0x170> 2008264: 80 a6 80 1b cmp %i2, %i3 (*printer)( 2008268: 15 00 80 56 sethi %hi(0x2015800), %o2 200826c: 90 10 00 19 mov %i1, %o0 2008270: 92 10 20 01 mov 1, %o1 2008274: 94 12 a0 70 or %o2, 0x70, %o2 2008278: 9f c7 40 00 call %i5 200827c: 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; 2008280: 10 80 00 d8 b 20085e0 <_Heap_Walk+0x4c8> 2008284: 82 10 20 00 clr %g1 ! 0 ); return false; } if ( 2008288: 02 80 00 06 be 20082a0 <_Heap_Walk+0x188> 200828c: 15 00 80 56 sethi %hi(0x2015800), %o2 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 2008290: 90 10 00 19 mov %i1, %o0 2008294: 92 10 20 01 mov 1, %o1 2008298: 10 bf ff f8 b 2008278 <_Heap_Walk+0x160> 200829c: 94 12 a0 88 or %o2, 0x88, %o2 int source, Heap_Walk_printer printer, Heap_Control *heap ) { uintptr_t const page_size = heap->page_size; 20082a0: 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; 20082a4: d6 06 20 08 ld [ %i0 + 8 ], %o3 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); 20082a8: 10 80 00 33 b 2008374 <_Heap_Walk+0x25c> 20082ac: 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; 20082b0: 80 a0 80 0b cmp %g2, %o3 20082b4: 18 80 00 05 bgu 20082c8 <_Heap_Walk+0x1b0> 20082b8: 82 10 20 00 clr %g1 20082bc: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 20082c0: 80 a0 40 0b cmp %g1, %o3 20082c4: 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 ) ) { 20082c8: 80 a0 60 00 cmp %g1, 0 20082cc: 32 80 00 07 bne,a 20082e8 <_Heap_Walk+0x1d0> 20082d0: 90 02 e0 08 add %o3, 8, %o0 (*printer)( 20082d4: 15 00 80 56 sethi %hi(0x2015800), %o2 20082d8: 90 10 00 19 mov %i1, %o0 20082dc: 92 10 20 01 mov 1, %o1 20082e0: 10 80 00 c7 b 20085fc <_Heap_Walk+0x4e4> 20082e4: 94 12 a0 b8 or %o2, 0xb8, %o2 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 20082e8: d6 27 bf f8 st %o3, [ %fp + -8 ] 20082ec: 7f ff e5 fd call 2001ae0 <.urem> 20082f0: 92 10 00 13 mov %l3, %o1 ); return false; } if ( 20082f4: 80 a2 20 00 cmp %o0, 0 20082f8: 02 80 00 07 be 2008314 <_Heap_Walk+0x1fc> 20082fc: d6 07 bf f8 ld [ %fp + -8 ], %o3 !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 2008300: 15 00 80 56 sethi %hi(0x2015800), %o2 2008304: 90 10 00 19 mov %i1, %o0 2008308: 92 10 20 01 mov 1, %o1 200830c: 10 80 00 bc b 20085fc <_Heap_Walk+0x4e4> 2008310: 94 12 a0 d8 or %o2, 0xd8, %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; 2008314: c2 02 e0 04 ld [ %o3 + 4 ], %g1 2008318: 82 08 7f fe and %g1, -2, %g1 block = next_block; } while ( block != first_block ); return true; } 200831c: 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; 2008320: c2 00 60 04 ld [ %g1 + 4 ], %g1 ); return false; } if ( _Heap_Is_used( free_block ) ) { 2008324: 80 88 60 01 btst 1, %g1 2008328: 22 80 00 07 be,a 2008344 <_Heap_Walk+0x22c> 200832c: d8 02 e0 0c ld [ %o3 + 0xc ], %o4 (*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 b0 b 20085fc <_Heap_Walk+0x4e4> 2008340: 94 12 a1 08 or %o2, 0x108, %o2 ); return false; } if ( free_block->prev != prev_block ) { 2008344: 80 a3 00 12 cmp %o4, %l2 2008348: 22 80 00 0a be,a 2008370 <_Heap_Walk+0x258> 200834c: a4 10 00 0b mov %o3, %l2 (*printer)( 2008350: 15 00 80 56 sethi %hi(0x2015800), %o2 2008354: 90 10 00 19 mov %i1, %o0 2008358: 92 10 20 01 mov 1, %o1 200835c: 94 12 a1 28 or %o2, 0x128, %o2 2008360: 9f c7 40 00 call %i5 2008364: 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; 2008368: 10 80 00 9e b 20085e0 <_Heap_Walk+0x4c8> 200836c: 82 10 20 00 clr %g1 ! 0 return false; } prev_block = free_block; free_block = free_block->next; 2008370: 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 ) { 2008374: 80 a2 c0 18 cmp %o3, %i0 2008378: 32 bf ff ce bne,a 20082b0 <_Heap_Walk+0x198> 200837c: c4 06 20 20 ld [ %i0 + 0x20 ], %g2 2008380: 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)( 2008384: 2f 00 80 56 sethi %hi(0x2015800), %l7 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008388: ac 15 a2 e8 or %l6, 0x2e8, %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)( 200838c: ae 15 e2 d0 or %l7, 0x2d0, %l7 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008390: 2b 00 80 56 sethi %hi(0x2015800), %l5 block = next_block; } while ( block != first_block ); return true; } 2008394: 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; 2008398: 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; 200839c: 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); 20083a0: 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; 20083a4: 80 a0 c0 13 cmp %g3, %l3 20083a8: 18 80 00 05 bgu 20083bc <_Heap_Walk+0x2a4> <== NEVER TAKEN 20083ac: 84 10 20 00 clr %g2 20083b0: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 20083b4: 80 a0 80 13 cmp %g2, %l3 20083b8: 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 ) ) { 20083bc: 80 a0 a0 00 cmp %g2, 0 20083c0: 12 80 00 07 bne 20083dc <_Heap_Walk+0x2c4> 20083c4: 84 1e 80 11 xor %i2, %l1, %g2 (*printer)( 20083c8: 15 00 80 56 sethi %hi(0x2015800), %o2 20083cc: 90 10 00 19 mov %i1, %o0 20083d0: 92 10 20 01 mov 1, %o1 20083d4: 10 80 00 2c b 2008484 <_Heap_Walk+0x36c> 20083d8: 94 12 a1 60 or %o2, 0x160, %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; 20083dc: 80 a0 00 02 cmp %g0, %g2 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 20083e0: c2 27 bf fc st %g1, [ %fp + -4 ] 20083e4: a8 40 20 00 addx %g0, 0, %l4 20083e8: 90 10 00 12 mov %l2, %o0 20083ec: 7f ff e5 bd call 2001ae0 <.urem> 20083f0: 92 10 00 1c mov %i4, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 20083f4: 80 a2 20 00 cmp %o0, 0 20083f8: 02 80 00 0c be 2008428 <_Heap_Walk+0x310> 20083fc: c2 07 bf fc ld [ %fp + -4 ], %g1 2008400: 80 8d 20 ff btst 0xff, %l4 2008404: 02 80 00 0a be 200842c <_Heap_Walk+0x314> 2008408: 80 a4 80 10 cmp %l2, %l0 (*printer)( 200840c: 15 00 80 56 sethi %hi(0x2015800), %o2 2008410: 90 10 00 19 mov %i1, %o0 2008414: 92 10 20 01 mov 1, %o1 2008418: 94 12 a1 90 or %o2, 0x190, %o2 200841c: 96 10 00 1a mov %i2, %o3 2008420: 10 bf ff d0 b 2008360 <_Heap_Walk+0x248> 2008424: 98 10 00 12 mov %l2, %o4 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 2008428: 80 a4 80 10 cmp %l2, %l0 200842c: 1a 80 00 0d bcc 2008460 <_Heap_Walk+0x348> 2008430: 80 a4 c0 1a cmp %l3, %i2 2008434: 80 8d 20 ff btst 0xff, %l4 2008438: 02 80 00 0a be 2008460 <_Heap_Walk+0x348> <== NEVER TAKEN 200843c: 80 a4 c0 1a cmp %l3, %i2 (*printer)( 2008440: 15 00 80 56 sethi %hi(0x2015800), %o2 2008444: 90 10 00 19 mov %i1, %o0 2008448: 92 10 20 01 mov 1, %o1 200844c: 94 12 a1 c0 or %o2, 0x1c0, %o2 2008450: 96 10 00 1a mov %i2, %o3 2008454: 98 10 00 12 mov %l2, %o4 2008458: 10 80 00 3d b 200854c <_Heap_Walk+0x434> 200845c: 9a 10 00 10 mov %l0, %o5 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 2008460: 38 80 00 0c bgu,a 2008490 <_Heap_Walk+0x378> 2008464: a8 08 60 01 and %g1, 1, %l4 2008468: 80 8d 20 ff btst 0xff, %l4 200846c: 02 80 00 09 be 2008490 <_Heap_Walk+0x378> 2008470: a8 08 60 01 and %g1, 1, %l4 (*printer)( 2008474: 15 00 80 56 sethi %hi(0x2015800), %o2 2008478: 90 10 00 19 mov %i1, %o0 200847c: 92 10 20 01 mov 1, %o1 2008480: 94 12 a1 f0 or %o2, 0x1f0, %o2 2008484: 96 10 00 1a mov %i2, %o3 2008488: 10 bf ff b6 b 2008360 <_Heap_Walk+0x248> 200848c: 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; 2008490: c2 04 e0 04 ld [ %l3 + 4 ], %g1 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 2008494: 80 88 60 01 btst 1, %g1 2008498: 12 80 00 40 bne 2008598 <_Heap_Walk+0x480> 200849c: 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 ? 20084a0: 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)( 20084a4: c2 06 20 08 ld [ %i0 + 8 ], %g1 20084a8: 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; 20084ac: c8 06 20 0c ld [ %i0 + 0xc ], %g4 20084b0: 80 a3 40 01 cmp %o5, %g1 20084b4: 02 80 00 07 be 20084d0 <_Heap_Walk+0x3b8> 20084b8: 86 10 a2 d0 or %g2, 0x2d0, %g3 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 20084bc: 80 a3 40 18 cmp %o5, %i0 20084c0: 12 80 00 04 bne 20084d0 <_Heap_Walk+0x3b8> 20084c4: 86 15 62 98 or %l5, 0x298, %g3 20084c8: 07 00 80 55 sethi %hi(0x2015400), %g3 20084cc: 86 10 e2 e0 or %g3, 0x2e0, %g3 ! 20156e0 <_Status_Object_name_errors_to_status+0x48> block->next, block->next == last_free_block ? 20084d0: 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)( 20084d4: 1f 00 80 55 sethi %hi(0x2015400), %o7 20084d8: 80 a0 80 04 cmp %g2, %g4 20084dc: 02 80 00 07 be 20084f8 <_Heap_Walk+0x3e0> 20084e0: 82 13 e2 f0 or %o7, 0x2f0, %g1 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 20084e4: 80 a0 80 18 cmp %g2, %i0 20084e8: 12 80 00 04 bne 20084f8 <_Heap_Walk+0x3e0> 20084ec: 82 15 62 98 or %l5, 0x298, %g1 20084f0: 03 00 80 55 sethi %hi(0x2015400), %g1 20084f4: 82 10 63 00 or %g1, 0x300, %g1 ! 2015700 <_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)( 20084f8: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 20084fc: c4 23 a0 60 st %g2, [ %sp + 0x60 ] 2008500: c2 23 a0 64 st %g1, [ %sp + 0x64 ] 2008504: 90 10 00 19 mov %i1, %o0 2008508: 92 10 20 00 clr %o1 200850c: 15 00 80 56 sethi %hi(0x2015800), %o2 2008510: 96 10 00 1a mov %i2, %o3 2008514: 94 12 a2 28 or %o2, 0x228, %o2 2008518: 9f c7 40 00 call %i5 200851c: 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 ) { 2008520: da 04 c0 00 ld [ %l3 ], %o5 2008524: 80 a4 80 0d cmp %l2, %o5 2008528: 02 80 00 0d be 200855c <_Heap_Walk+0x444> 200852c: 80 a5 20 00 cmp %l4, 0 (*printer)( 2008530: 15 00 80 56 sethi %hi(0x2015800), %o2 2008534: e6 23 a0 5c st %l3, [ %sp + 0x5c ] 2008538: 90 10 00 19 mov %i1, %o0 200853c: 92 10 20 01 mov 1, %o1 2008540: 94 12 a2 60 or %o2, 0x260, %o2 2008544: 96 10 00 1a mov %i2, %o3 2008548: 98 10 00 12 mov %l2, %o4 200854c: 9f c7 40 00 call %i5 2008550: 01 00 00 00 nop 2008554: 10 80 00 23 b 20085e0 <_Heap_Walk+0x4c8> 2008558: 82 10 20 00 clr %g1 ! 0 ); return false; } if ( !prev_used ) { 200855c: 32 80 00 0a bne,a 2008584 <_Heap_Walk+0x46c> 2008560: c2 06 20 08 ld [ %i0 + 8 ], %g1 (*printer)( 2008564: 15 00 80 56 sethi %hi(0x2015800), %o2 2008568: 90 10 00 19 mov %i1, %o0 200856c: 92 10 20 01 mov 1, %o1 2008570: 10 80 00 22 b 20085f8 <_Heap_Walk+0x4e0> 2008574: 94 12 a2 a0 or %o2, 0x2a0, %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 ) { 2008578: 02 80 00 17 be 20085d4 <_Heap_Walk+0x4bc> 200857c: 80 a4 c0 1b cmp %l3, %i3 return true; } free_block = free_block->next; 2008580: 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 ) { 2008584: 80 a0 40 18 cmp %g1, %i0 2008588: 12 bf ff fc bne 2008578 <_Heap_Walk+0x460> 200858c: 80 a0 40 1a cmp %g1, %i2 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 2008590: 10 80 00 17 b 20085ec <_Heap_Walk+0x4d4> 2008594: 15 00 80 56 sethi %hi(0x2015800), %o2 if ( !_Heap_Is_prev_used( next_block ) ) { if ( !_Heap_Walk_check_free_block( source, printer, heap, block ) ) { return false; } } else if (prev_used) { 2008598: 80 a5 20 00 cmp %l4, 0 200859c: 02 80 00 08 be 20085bc <_Heap_Walk+0x4a4> 20085a0: 92 10 20 00 clr %o1 (*printer)( 20085a4: 94 10 00 17 mov %l7, %o2 20085a8: 96 10 00 1a mov %i2, %o3 20085ac: 9f c7 40 00 call %i5 20085b0: 98 10 00 12 mov %l2, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 20085b4: 10 80 00 08 b 20085d4 <_Heap_Walk+0x4bc> 20085b8: 80 a4 c0 1b cmp %l3, %i3 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 20085bc: da 06 80 00 ld [ %i2 ], %o5 20085c0: 94 10 00 16 mov %l6, %o2 20085c4: 96 10 00 1a mov %i2, %o3 20085c8: 9f c7 40 00 call %i5 20085cc: 98 10 00 12 mov %l2, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 20085d0: 80 a4 c0 1b cmp %l3, %i3 20085d4: 12 bf ff 70 bne 2008394 <_Heap_Walk+0x27c> 20085d8: b4 10 00 13 mov %l3, %i2 return true; 20085dc: 82 10 20 01 mov 1, %g1 } 20085e0: b0 08 60 01 and %g1, 1, %i0 20085e4: 81 c7 e0 08 ret 20085e8: 81 e8 00 00 restore return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 20085ec: 90 10 00 19 mov %i1, %o0 20085f0: 92 10 20 01 mov 1, %o1 20085f4: 94 12 a3 10 or %o2, 0x310, %o2 20085f8: 96 10 00 1a mov %i2, %o3 20085fc: 9f c7 40 00 call %i5 2008600: 01 00 00 00 nop 2008604: 10 bf ff f7 b 20085e0 <_Heap_Walk+0x4c8> 2008608: 82 10 20 00 clr %g1 ! 0 =============================================================================== 020078f4 <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 20078f4: 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 ) 20078f8: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 20078fc: 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 ) 2007900: 80 a0 60 00 cmp %g1, 0 2007904: 02 80 00 20 be 2007984 <_Objects_Allocate+0x90> <== NEVER TAKEN 2007908: 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 ); 200790c: b8 07 60 20 add %i5, 0x20, %i4 2007910: 7f ff fd 87 call 2006f2c <_Chain_Get> 2007914: 90 10 00 1c mov %i4, %o0 if ( information->auto_extend ) { 2007918: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1 200791c: 80 a0 60 00 cmp %g1, 0 2007920: 02 80 00 19 be 2007984 <_Objects_Allocate+0x90> 2007924: 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 ) { 2007928: 80 a2 20 00 cmp %o0, 0 200792c: 32 80 00 0a bne,a 2007954 <_Objects_Allocate+0x60> 2007930: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 _Objects_Extend_information( information ); 2007934: 40 00 00 1d call 20079a8 <_Objects_Extend_information> 2007938: 90 10 00 1d mov %i5, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 200793c: 7f ff fd 7c call 2006f2c <_Chain_Get> 2007940: 90 10 00 1c mov %i4, %o0 } if ( the_object ) { 2007944: b0 92 20 00 orcc %o0, 0, %i0 2007948: 02 80 00 0f be 2007984 <_Objects_Allocate+0x90> 200794c: 01 00 00 00 nop uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 2007950: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 2007954: d0 16 20 0a lduh [ %i0 + 0xa ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 2007958: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1 200795c: 40 00 3f a4 call 20177ec <.udiv> 2007960: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 2007964: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 2007968: 91 2a 20 02 sll %o0, 2, %o0 200796c: c4 00 40 08 ld [ %g1 + %o0 ], %g2 2007970: 84 00 bf ff add %g2, -1, %g2 2007974: c4 20 40 08 st %g2, [ %g1 + %o0 ] information->inactive--; 2007978: c2 17 60 2c lduh [ %i5 + 0x2c ], %g1 200797c: 82 00 7f ff add %g1, -1, %g1 2007980: c2 37 60 2c sth %g1, [ %i5 + 0x2c ] ); } #endif return the_object; } 2007984: 81 c7 e0 08 ret 2007988: 81 e8 00 00 restore =============================================================================== 02007d00 <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 2007d00: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 2007d04: 80 a6 60 00 cmp %i1, 0 2007d08: 02 80 00 17 be 2007d64 <_Objects_Get_information+0x64> 2007d0c: 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 ); 2007d10: 40 00 13 89 call 200cb34 <_Objects_API_maximum_class> 2007d14: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 2007d18: 80 a2 20 00 cmp %o0, 0 2007d1c: 02 80 00 12 be 2007d64 <_Objects_Get_information+0x64> 2007d20: 80 a6 40 08 cmp %i1, %o0 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 2007d24: 18 80 00 10 bgu 2007d64 <_Objects_Get_information+0x64> 2007d28: 03 00 80 72 sethi %hi(0x201c800), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 2007d2c: b1 2e 20 02 sll %i0, 2, %i0 2007d30: 82 10 61 28 or %g1, 0x128, %g1 2007d34: c2 00 40 18 ld [ %g1 + %i0 ], %g1 2007d38: 80 a0 60 00 cmp %g1, 0 2007d3c: 02 80 00 0a be 2007d64 <_Objects_Get_information+0x64> <== NEVER TAKEN 2007d40: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 2007d44: fa 00 40 19 ld [ %g1 + %i1 ], %i5 if ( !info ) 2007d48: 80 a7 60 00 cmp %i5, 0 2007d4c: 02 80 00 06 be 2007d64 <_Objects_Get_information+0x64> <== NEVER TAKEN 2007d50: 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 ) 2007d54: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1 return NULL; 2007d58: 80 a0 00 01 cmp %g0, %g1 2007d5c: 82 60 20 00 subx %g0, 0, %g1 2007d60: ba 0f 40 01 and %i5, %g1, %i5 #endif return info; } 2007d64: 81 c7 e0 08 ret 2007d68: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02008834 <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 2008834: 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; 2008838: 92 96 20 00 orcc %i0, 0, %o1 200883c: 12 80 00 06 bne 2008854 <_Objects_Id_to_name+0x20> 2008840: 83 32 60 18 srl %o1, 0x18, %g1 2008844: 03 00 80 78 sethi %hi(0x201e000), %g1 2008848: c2 00 62 e4 ld [ %g1 + 0x2e4 ], %g1 ! 201e2e4 <_Per_CPU_Information+0xc> 200884c: d2 00 60 08 ld [ %g1 + 8 ], %o1 2008850: 83 32 60 18 srl %o1, 0x18, %g1 2008854: 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 ) 2008858: 84 00 7f ff add %g1, -1, %g2 200885c: 80 a0 a0 02 cmp %g2, 2 2008860: 18 80 00 16 bgu 20088b8 <_Objects_Id_to_name+0x84> 2008864: 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 ] ) 2008868: 10 80 00 16 b 20088c0 <_Objects_Id_to_name+0x8c> 200886c: 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 ]; 2008870: 85 28 a0 02 sll %g2, 2, %g2 2008874: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 2008878: 80 a2 20 00 cmp %o0, 0 200887c: 02 80 00 0f be 20088b8 <_Objects_Id_to_name+0x84> <== NEVER TAKEN 2008880: 01 00 00 00 nop return OBJECTS_INVALID_ID; #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) 2008884: c2 0a 20 38 ldub [ %o0 + 0x38 ], %g1 2008888: 80 a0 60 00 cmp %g1, 0 200888c: 12 80 00 0b bne 20088b8 <_Objects_Id_to_name+0x84> <== NEVER TAKEN 2008890: 01 00 00 00 nop return OBJECTS_INVALID_ID; #endif the_object = _Objects_Get( information, tmpId, &ignored_location ); 2008894: 7f ff ff ca call 20087bc <_Objects_Get> 2008898: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 200889c: 80 a2 20 00 cmp %o0, 0 20088a0: 02 80 00 06 be 20088b8 <_Objects_Id_to_name+0x84> 20088a4: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 20088a8: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 20088ac: 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(); 20088b0: 40 00 03 7e call 20096a8 <_Thread_Enable_dispatch> 20088b4: c2 26 40 00 st %g1, [ %i1 ] return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; } 20088b8: 81 c7 e0 08 ret 20088bc: 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 ] ) 20088c0: 05 00 80 77 sethi %hi(0x201dc00), %g2 20088c4: 84 10 a1 08 or %g2, 0x108, %g2 ! 201dd08 <_Objects_Information_table> 20088c8: c2 00 80 01 ld [ %g2 + %g1 ], %g1 20088cc: 80 a0 60 00 cmp %g1, 0 20088d0: 12 bf ff e8 bne 2008870 <_Objects_Id_to_name+0x3c> 20088d4: 85 32 60 1b srl %o1, 0x1b, %g2 20088d8: 30 bf ff f8 b,a 20088b8 <_Objects_Id_to_name+0x84> =============================================================================== 0200b424 <_POSIX_Message_queue_Receive_support>: size_t msg_len, unsigned int *msg_prio, bool wait, Watchdog_Interval timeout ) { 200b424: 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( 200b428: 11 00 80 9b sethi %hi(0x2026c00), %o0 200b42c: 92 10 00 18 mov %i0, %o1 200b430: 90 12 23 ac or %o0, 0x3ac, %o0 200b434: 40 00 0c 87 call 200e650 <_Objects_Get> 200b438: 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 ) { 200b43c: c2 07 bf f8 ld [ %fp + -8 ], %g1 200b440: 80 a0 60 00 cmp %g1, 0 200b444: 12 80 00 3f bne 200b540 <_POSIX_Message_queue_Receive_support+0x11c> 200b448: 01 00 00 00 nop case OBJECTS_LOCAL: if ( (the_mq_fd->oflag & O_ACCMODE) == O_WRONLY ) { 200b44c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200b450: 84 08 60 03 and %g1, 3, %g2 200b454: 80 a0 a0 01 cmp %g2, 1 200b458: 32 80 00 08 bne,a 200b478 <_POSIX_Message_queue_Receive_support+0x54> 200b45c: d0 02 20 10 ld [ %o0 + 0x10 ], %o0 _Thread_Enable_dispatch(); 200b460: 40 00 10 2c call 200f510 <_Thread_Enable_dispatch> 200b464: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EBADF ); 200b468: 40 00 29 d6 call 2015bc0 <__errno> 200b46c: 01 00 00 00 nop 200b470: 10 80 00 0b b 200b49c <_POSIX_Message_queue_Receive_support+0x78> 200b474: 82 10 20 09 mov 9, %g1 ! 9 } the_mq = the_mq_fd->Queue; if ( msg_len < the_mq->Message_queue.maximum_message_size ) { 200b478: c4 02 20 68 ld [ %o0 + 0x68 ], %g2 200b47c: 80 a6 80 02 cmp %i2, %g2 200b480: 1a 80 00 09 bcc 200b4a4 <_POSIX_Message_queue_Receive_support+0x80> 200b484: 84 10 3f ff mov -1, %g2 _Thread_Enable_dispatch(); 200b488: 40 00 10 22 call 200f510 <_Thread_Enable_dispatch> 200b48c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EMSGSIZE ); 200b490: 40 00 29 cc call 2015bc0 <__errno> 200b494: 01 00 00 00 nop 200b498: 82 10 20 7a mov 0x7a, %g1 ! 7a 200b49c: 10 80 00 27 b 200b538 <_POSIX_Message_queue_Receive_support+0x114> 200b4a0: 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; 200b4a4: c4 27 bf fc st %g2, [ %fp + -4 ] /* * A timed receive with a bad time will do a poll regardless. */ if ( wait ) 200b4a8: 80 a7 20 00 cmp %i4, 0 200b4ac: 02 80 00 06 be 200b4c4 <_POSIX_Message_queue_Receive_support+0xa0><== NEVER TAKEN 200b4b0: 98 10 20 00 clr %o4 do_wait = (the_mq_fd->oflag & O_NONBLOCK) ? false : true; 200b4b4: 05 00 00 10 sethi %hi(0x4000), %g2 200b4b8: 82 08 40 02 and %g1, %g2, %g1 200b4bc: 80 a0 00 01 cmp %g0, %g1 200b4c0: 98 60 3f ff subx %g0, -1, %o4 do_wait = wait; /* * Now perform the actual message receive */ _CORE_message_queue_Seize( 200b4c4: 9a 10 00 1d mov %i5, %o5 200b4c8: 90 02 20 1c add %o0, 0x1c, %o0 200b4cc: 92 10 00 18 mov %i0, %o1 200b4d0: 94 10 00 19 mov %i1, %o2 200b4d4: 96 07 bf fc add %fp, -4, %o3 200b4d8: 40 00 08 32 call 200d5a0 <_CORE_message_queue_Seize> 200b4dc: 98 0b 20 01 and %o4, 1, %o4 &length_out, do_wait, timeout ); _Thread_Enable_dispatch(); 200b4e0: 40 00 10 0c call 200f510 <_Thread_Enable_dispatch> 200b4e4: 3b 00 80 9c sethi %hi(0x2027000), %i5 *msg_prio = _POSIX_Message_queue_Priority_from_core(_Thread_Executing->Wait.count); 200b4e8: ba 17 60 18 or %i5, 0x18, %i5 ! 2027018 <_Per_CPU_Information> 200b4ec: 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); 200b4f0: c6 00 60 24 ld [ %g1 + 0x24 ], %g3 if ( !_Thread_Executing->Wait.return_code ) 200b4f4: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 200b4f8: 85 38 e0 1f sra %g3, 0x1f, %g2 200b4fc: 86 18 80 03 xor %g2, %g3, %g3 200b500: 84 20 c0 02 sub %g3, %g2, %g2 200b504: 80 a0 60 00 cmp %g1, 0 200b508: 12 80 00 05 bne 200b51c <_POSIX_Message_queue_Receive_support+0xf8> 200b50c: c4 26 c0 00 st %g2, [ %i3 ] return length_out; 200b510: f0 07 bf fc ld [ %fp + -4 ], %i0 200b514: 81 c7 e0 08 ret 200b518: 81 e8 00 00 restore rtems_set_errno_and_return_minus_one( 200b51c: 40 00 29 a9 call 2015bc0 <__errno> 200b520: 01 00 00 00 nop 200b524: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200b528: b8 10 00 08 mov %o0, %i4 200b52c: 40 00 00 9b call 200b798 <_POSIX_Message_queue_Translate_core_message_queue_return_code> 200b530: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 200b534: d0 27 00 00 st %o0, [ %i4 ] 200b538: 81 c7 e0 08 ret 200b53c: 91 e8 3f ff restore %g0, -1, %o0 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EBADF ); 200b540: 40 00 29 a0 call 2015bc0 <__errno> 200b544: b0 10 3f ff mov -1, %i0 200b548: 82 10 20 09 mov 9, %g1 200b54c: c2 22 00 00 st %g1, [ %o0 ] } 200b550: 81 c7 e0 08 ret 200b554: 81 e8 00 00 restore =============================================================================== 0200b6a4 <_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 ]; 200b6a4: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 200b6a8: c4 00 60 d8 ld [ %g1 + 0xd8 ], %g2 200b6ac: 80 a0 a0 00 cmp %g2, 0 200b6b0: 12 80 00 13 bne 200b6fc <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x58><== NEVER TAKEN 200b6b4: 01 00 00 00 nop 200b6b8: c4 00 60 dc ld [ %g1 + 0xdc ], %g2 200b6bc: 80 a0 a0 01 cmp %g2, 1 200b6c0: 12 80 00 0f bne 200b6fc <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x58> 200b6c4: 01 00 00 00 nop thread_support->cancelability_type == PTHREAD_CANCEL_ASYNCHRONOUS && 200b6c8: c2 00 60 e0 ld [ %g1 + 0xe0 ], %g1 200b6cc: 80 a0 60 00 cmp %g1, 0 200b6d0: 02 80 00 0b be 200b6fc <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x58> 200b6d4: 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--; 200b6d8: 03 00 80 5c sethi %hi(0x2017000), %g1 200b6dc: c4 00 60 30 ld [ %g1 + 0x30 ], %g2 ! 2017030 <_Thread_Dispatch_disable_level> thread_support->cancelation_requested ) { _Thread_Unnest_dispatch(); _POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED ); 200b6e0: 92 10 3f ff mov -1, %o1 200b6e4: 84 00 bf ff add %g2, -1, %g2 200b6e8: c4 20 60 30 st %g2, [ %g1 + 0x30 ] return _Thread_Dispatch_disable_level; 200b6ec: c2 00 60 30 ld [ %g1 + 0x30 ], %g1 200b6f0: 82 13 c0 00 mov %o7, %g1 200b6f4: 40 00 01 b1 call 200bdb8 <_POSIX_Thread_Exit> 200b6f8: 9e 10 40 00 mov %g1, %o7 } else _Thread_Enable_dispatch(); 200b6fc: 82 13 c0 00 mov %o7, %g1 200b700: 7f ff f4 dd call 2008a74 <_Thread_Enable_dispatch> 200b704: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200c9c8 <_POSIX_Thread_Translate_sched_param>: int policy, struct sched_param *param, Thread_CPU_budget_algorithms *budget_algorithm, Thread_CPU_budget_algorithm_callout *budget_callout ) { 200c9c8: 9d e3 bf a0 save %sp, -96, %sp if ( !_POSIX_Priority_Is_valid( param->sched_priority ) ) 200c9cc: d0 06 40 00 ld [ %i1 ], %o0 200c9d0: 7f ff ff f3 call 200c99c <_POSIX_Priority_Is_valid> 200c9d4: ba 10 00 18 mov %i0, %i5 200c9d8: 80 8a 20 ff btst 0xff, %o0 200c9dc: 02 80 00 11 be 200ca20 <_POSIX_Thread_Translate_sched_param+0x58><== NEVER TAKEN 200c9e0: b0 10 20 16 mov 0x16, %i0 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; 200c9e4: c0 26 80 00 clr [ %i2 ] *budget_callout = NULL; if ( policy == SCHED_OTHER ) { 200c9e8: 80 a7 60 00 cmp %i5, 0 200c9ec: 12 80 00 06 bne 200ca04 <_POSIX_Thread_Translate_sched_param+0x3c> 200c9f0: c0 26 c0 00 clr [ %i3 ] *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 200c9f4: 82 10 20 01 mov 1, %g1 200c9f8: c2 26 80 00 st %g1, [ %i2 ] return 0; 200c9fc: 81 c7 e0 08 ret 200ca00: 91 e8 20 00 restore %g0, 0, %o0 } if ( policy == SCHED_FIFO ) { 200ca04: 80 a7 60 01 cmp %i5, 1 200ca08: 02 80 00 06 be 200ca20 <_POSIX_Thread_Translate_sched_param+0x58> 200ca0c: b0 10 20 00 clr %i0 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; return 0; } if ( policy == SCHED_RR ) { 200ca10: 80 a7 60 02 cmp %i5, 2 200ca14: 32 80 00 05 bne,a 200ca28 <_POSIX_Thread_Translate_sched_param+0x60> 200ca18: 80 a7 60 04 cmp %i5, 4 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE; 200ca1c: fa 26 80 00 st %i5, [ %i2 ] return 0; 200ca20: 81 c7 e0 08 ret 200ca24: 81 e8 00 00 restore } if ( policy == SCHED_SPORADIC ) { 200ca28: 12 bf ff fe bne 200ca20 <_POSIX_Thread_Translate_sched_param+0x58> 200ca2c: b0 10 20 16 mov 0x16, %i0 if ( (param->sched_ss_repl_period.tv_sec == 0) && 200ca30: c2 06 60 08 ld [ %i1 + 8 ], %g1 200ca34: 80 a0 60 00 cmp %g1, 0 200ca38: 32 80 00 07 bne,a 200ca54 <_POSIX_Thread_Translate_sched_param+0x8c> 200ca3c: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200ca40: c2 06 60 0c ld [ %i1 + 0xc ], %g1 200ca44: 80 a0 60 00 cmp %g1, 0 200ca48: 02 80 00 1d be 200cabc <_POSIX_Thread_Translate_sched_param+0xf4> 200ca4c: 01 00 00 00 nop (param->sched_ss_repl_period.tv_nsec == 0) ) return EINVAL; if ( (param->sched_ss_init_budget.tv_sec == 0) && 200ca50: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200ca54: 80 a0 60 00 cmp %g1, 0 200ca58: 12 80 00 06 bne 200ca70 <_POSIX_Thread_Translate_sched_param+0xa8> 200ca5c: 01 00 00 00 nop 200ca60: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200ca64: 80 a0 60 00 cmp %g1, 0 200ca68: 02 bf ff ee be 200ca20 <_POSIX_Thread_Translate_sched_param+0x58> 200ca6c: 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 ) < 200ca70: 7f ff f6 28 call 200a310 <_Timespec_To_ticks> 200ca74: 90 06 60 08 add %i1, 8, %o0 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) return EINVAL; 200ca78: 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 ) < 200ca7c: ba 10 00 08 mov %o0, %i5 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) 200ca80: 7f ff f6 24 call 200a310 <_Timespec_To_ticks> 200ca84: 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 ) < 200ca88: 80 a7 40 08 cmp %i5, %o0 200ca8c: 0a 80 00 0c bcs 200cabc <_POSIX_Thread_Translate_sched_param+0xf4> 200ca90: 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 ) ) 200ca94: 7f ff ff c2 call 200c99c <_POSIX_Priority_Is_valid> 200ca98: d0 06 60 04 ld [ %i1 + 4 ], %o0 200ca9c: 80 8a 20 ff btst 0xff, %o0 200caa0: 02 bf ff e0 be 200ca20 <_POSIX_Thread_Translate_sched_param+0x58> 200caa4: 82 10 20 03 mov 3, %g1 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_CALLOUT; 200caa8: c2 26 80 00 st %g1, [ %i2 ] *budget_callout = _POSIX_Threads_Sporadic_budget_callout; return 0; 200caac: 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; 200cab0: 03 00 80 19 sethi %hi(0x2006400), %g1 200cab4: 82 10 62 3c or %g1, 0x23c, %g1 ! 200663c <_POSIX_Threads_Sporadic_budget_callout> 200cab8: c2 26 c0 00 st %g1, [ %i3 ] return 0; } return EINVAL; } 200cabc: 81 c7 e0 08 ret 200cac0: 81 e8 00 00 restore =============================================================================== 02006388 <_POSIX_Threads_Initialize_user_threads_body>: * * Output parameters: NONE */ void _POSIX_Threads_Initialize_user_threads_body(void) { 2006388: 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; 200638c: 03 00 80 71 sethi %hi(0x201c400), %g1 2006390: 82 10 62 74 or %g1, 0x274, %g1 ! 201c674 maximum = Configuration_POSIX_API.number_of_initialization_threads; 2006394: f6 00 60 30 ld [ %g1 + 0x30 ], %i3 if ( !user_threads || maximum == 0 ) 2006398: 80 a6 e0 00 cmp %i3, 0 200639c: 02 80 00 1b be 2006408 <_POSIX_Threads_Initialize_user_threads_body+0x80><== NEVER TAKEN 20063a0: fa 00 60 34 ld [ %g1 + 0x34 ], %i5 20063a4: 80 a7 60 00 cmp %i5, 0 20063a8: 02 80 00 18 be 2006408 <_POSIX_Threads_Initialize_user_threads_body+0x80><== NEVER TAKEN 20063ac: 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 ); 20063b0: 40 00 19 c5 call 200cac4 20063b4: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setinheritsched( &attr, PTHREAD_EXPLICIT_SCHED ); 20063b8: 92 10 20 02 mov 2, %o1 20063bc: 40 00 19 ce call 200caf4 20063c0: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setstacksize(&attr, user_threads[ index ].stack_size); 20063c4: d2 07 60 04 ld [ %i5 + 4 ], %o1 20063c8: 40 00 19 da call 200cb30 20063cc: 90 07 bf bc add %fp, -68, %o0 status = pthread_create( 20063d0: d4 07 40 00 ld [ %i5 ], %o2 20063d4: 90 07 bf fc add %fp, -4, %o0 20063d8: 92 07 bf bc add %fp, -68, %o1 20063dc: 7f ff ff 39 call 20060c0 20063e0: 96 10 20 00 clr %o3 &thread_id, &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) 20063e4: 94 92 20 00 orcc %o0, 0, %o2 20063e8: 22 80 00 05 be,a 20063fc <_POSIX_Threads_Initialize_user_threads_body+0x74> 20063ec: b8 07 20 01 inc %i4 _Internal_error_Occurred( INTERNAL_ERROR_POSIX_API, true, status ); 20063f0: 90 10 20 02 mov 2, %o0 20063f4: 40 00 07 f0 call 20083b4 <_Internal_error_Occurred> 20063f8: 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++ ) { 20063fc: 80 a7 00 1b cmp %i4, %i3 2006400: 0a bf ff ec bcs 20063b0 <_POSIX_Threads_Initialize_user_threads_body+0x28><== NEVER TAKEN 2006404: ba 07 60 08 add %i5, 8, %i5 2006408: 81 c7 e0 08 ret 200640c: 81 e8 00 00 restore =============================================================================== 0200bf0c <_POSIX_Threads_Sporadic_budget_TSR>: */ void _POSIX_Threads_Sporadic_budget_TSR( Objects_Id id __attribute__((unused)), void *argument ) { 200bf0c: 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 ]; 200bf10: 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 ); 200bf14: 40 00 03 c9 call 200ce38 <_Timespec_To_ticks> 200bf18: 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); 200bf1c: 03 00 80 6f sethi %hi(0x201bc00), %g1 200bf20: d2 08 60 9c ldub [ %g1 + 0x9c ], %o1 ! 201bc9c 200bf24: c2 07 60 88 ld [ %i5 + 0x88 ], %g1 the_thread->cpu_time_budget = ticks; 200bf28: d0 26 60 78 st %o0, [ %i1 + 0x78 ] 200bf2c: 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 ) { 200bf30: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 200bf34: 80 a0 60 00 cmp %g1, 0 200bf38: 12 80 00 08 bne 200bf58 <_POSIX_Threads_Sporadic_budget_TSR+0x4c><== NEVER TAKEN 200bf3c: 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 ) { 200bf40: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200bf44: 80 a0 40 09 cmp %g1, %o1 200bf48: 08 80 00 04 bleu 200bf58 <_POSIX_Threads_Sporadic_budget_TSR+0x4c> 200bf4c: 90 10 00 19 mov %i1, %o0 _Thread_Change_priority( the_thread, new_priority, true ); 200bf50: 7f ff f2 3c call 2008840 <_Thread_Change_priority> 200bf54: 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 ); 200bf58: 40 00 03 b8 call 200ce38 <_Timespec_To_ticks> 200bf5c: 90 07 60 90 add %i5, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200bf60: 31 00 80 72 sethi %hi(0x201c800), %i0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200bf64: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200bf68: b0 16 22 7c or %i0, 0x27c, %i0 200bf6c: 7f ff f6 cf call 2009aa8 <_Watchdog_Insert> 200bf70: 93 ef 60 a8 restore %i5, 0xa8, %o1 =============================================================================== 0200bf74 <_POSIX_Threads_Sporadic_budget_callout>: ) { POSIX_API_Control *api; uint32_t new_priority; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200bf74: 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 */ 200bf78: 86 10 3f ff mov -1, %g3 200bf7c: c4 00 a0 8c ld [ %g2 + 0x8c ], %g2 200bf80: c6 22 20 78 st %g3, [ %o0 + 0x78 ] 200bf84: 07 00 80 6f sethi %hi(0x201bc00), %g3 200bf88: d2 08 e0 9c ldub [ %g3 + 0x9c ], %o1 ! 201bc9c 200bf8c: 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 ) { 200bf90: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 200bf94: 80 a0 a0 00 cmp %g2, 0 200bf98: 12 80 00 09 bne 200bfbc <_POSIX_Threads_Sporadic_budget_callout+0x48><== NEVER TAKEN 200bf9c: 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 ) { 200bfa0: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200bfa4: 80 a0 40 09 cmp %g1, %o1 200bfa8: 1a 80 00 05 bcc 200bfbc <_POSIX_Threads_Sporadic_budget_callout+0x48><== NEVER TAKEN 200bfac: 94 10 20 01 mov 1, %o2 _Thread_Change_priority( the_thread, new_priority, true ); 200bfb0: 82 13 c0 00 mov %o7, %g1 200bfb4: 7f ff f2 23 call 2008840 <_Thread_Change_priority> 200bfb8: 9e 10 40 00 mov %g1, %o7 200bfbc: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 02006138 <_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) { 2006138: 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; 200613c: c2 06 60 68 ld [ %i1 + 0x68 ], %g1 2006140: 82 00 60 01 inc %g1 2006144: c2 26 60 68 st %g1, [ %i1 + 0x68 ] /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 2006148: c2 06 60 54 ld [ %i1 + 0x54 ], %g1 200614c: 80 a0 60 00 cmp %g1, 0 2006150: 32 80 00 07 bne,a 200616c <_POSIX_Timer_TSR+0x34> 2006154: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 2006158: c2 06 60 58 ld [ %i1 + 0x58 ], %g1 200615c: 80 a0 60 00 cmp %g1, 0 2006160: 02 80 00 0f be 200619c <_POSIX_Timer_TSR+0x64> <== NEVER TAKEN 2006164: 82 10 20 04 mov 4, %g1 ( ptimer->timer_data.it_interval.tv_nsec != 0 ) ) { activated = _POSIX_Timer_Insert_helper( 2006168: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 200616c: d4 06 60 08 ld [ %i1 + 8 ], %o2 2006170: 90 06 60 10 add %i1, 0x10, %o0 2006174: 17 00 80 18 sethi %hi(0x2006000), %o3 2006178: 98 10 00 19 mov %i1, %o4 200617c: 40 00 19 70 call 200c73c <_POSIX_Timer_Insert_helper> 2006180: 96 12 e1 38 or %o3, 0x138, %o3 ptimer->ticks, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) 2006184: 80 8a 20 ff btst 0xff, %o0 2006188: 02 80 00 0a be 20061b0 <_POSIX_Timer_TSR+0x78> <== NEVER TAKEN 200618c: 01 00 00 00 nop return; /* Store the time when the timer was started again */ _TOD_Get( &ptimer->time ); 2006190: 40 00 05 bd call 2007884 <_TOD_Get> 2006194: 90 06 60 6c add %i1, 0x6c, %o0 2006198: 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 ) ) { 200619c: d0 06 60 38 ld [ %i1 + 0x38 ], %o0 20061a0: d2 06 60 44 ld [ %i1 + 0x44 ], %o1 20061a4: 40 00 18 53 call 200c2f0 20061a8: 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; 20061ac: c0 26 60 68 clr [ %i1 + 0x68 ] 20061b0: 81 c7 e0 08 ret 20061b4: 81 e8 00 00 restore =============================================================================== 0200e204 <_POSIX_signals_Check_signal>: bool _POSIX_signals_Check_signal( POSIX_API_Control *api, int signo, bool is_global ) { 200e204: 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, 200e208: 98 10 20 01 mov 1, %o4 200e20c: 90 10 00 18 mov %i0, %o0 200e210: 92 10 00 19 mov %i1, %o1 200e214: 94 07 bf f4 add %fp, -12, %o2 200e218: 40 00 00 2e call 200e2d0 <_POSIX_signals_Clear_signals> 200e21c: 96 10 00 1a mov %i2, %o3 200e220: 80 8a 20 ff btst 0xff, %o0 200e224: 02 80 00 28 be 200e2c4 <_POSIX_signals_Check_signal+0xc0> 200e228: 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 ) 200e22c: 85 2e 60 02 sll %i1, 2, %g2 200e230: 35 00 80 73 sethi %hi(0x201cc00), %i2 200e234: b7 2e 60 04 sll %i1, 4, %i3 200e238: b4 16 a3 50 or %i2, 0x350, %i2 200e23c: b6 26 c0 02 sub %i3, %g2, %i3 200e240: 84 06 80 1b add %i2, %i3, %g2 200e244: fa 00 a0 08 ld [ %g2 + 8 ], %i5 200e248: 80 a7 60 01 cmp %i5, 1 200e24c: 02 80 00 1e be 200e2c4 <_POSIX_signals_Check_signal+0xc0> <== NEVER TAKEN 200e250: 90 07 bf cc add %fp, -52, %o0 return false; /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; 200e254: f8 06 20 d0 ld [ %i0 + 0xd0 ], %i4 api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 200e258: c2 00 a0 04 ld [ %g2 + 4 ], %g1 200e25c: 82 10 40 1c or %g1, %i4, %g1 200e260: 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, 200e264: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e268: d2 00 63 04 ld [ %g1 + 0x304 ], %o1 ! 201cf04 <_Per_CPU_Information+0xc> 200e26c: 94 10 20 28 mov 0x28, %o2 200e270: 40 00 04 41 call 200f374 200e274: 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 ) { 200e278: c2 06 80 1b ld [ %i2 + %i3 ], %g1 200e27c: 80 a0 60 02 cmp %g1, 2 200e280: 12 80 00 07 bne 200e29c <_POSIX_signals_Check_signal+0x98> 200e284: 90 10 00 19 mov %i1, %o0 case SA_SIGINFO: (*_POSIX_signals_Vectors[ signo ].sa_sigaction)( 200e288: 92 07 bf f4 add %fp, -12, %o1 200e28c: 9f c7 40 00 call %i5 200e290: 94 10 20 00 clr %o2 signo, &siginfo_struct, NULL /* context is undefined per 1003.1b-1993, p. 66 */ ); break; 200e294: 10 80 00 05 b 200e2a8 <_POSIX_signals_Check_signal+0xa4> 200e298: 03 00 80 73 sethi %hi(0x201cc00), %g1 default: (*_POSIX_signals_Vectors[ signo ].sa_handler)( signo ); 200e29c: 9f c7 40 00 call %i5 200e2a0: 01 00 00 00 nop } /* * Restore the blocking information */ memcpy( &_Thread_Executing->Wait, &stored_thread_wait_information, 200e2a4: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e2a8: d0 00 63 04 ld [ %g1 + 0x304 ], %o0 ! 201cf04 <_Per_CPU_Information+0xc> 200e2ac: 92 07 bf cc add %fp, -52, %o1 200e2b0: 90 02 20 20 add %o0, 0x20, %o0 200e2b4: 40 00 04 30 call 200f374 200e2b8: 94 10 20 28 mov 0x28, %o2 /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; return true; 200e2bc: 82 10 20 01 mov 1, %g1 sizeof( Thread_Wait_information )); /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; 200e2c0: f8 26 20 d0 st %i4, [ %i0 + 0xd0 ] return true; } 200e2c4: b0 08 60 01 and %g1, 1, %i0 200e2c8: 81 c7 e0 08 ret 200e2cc: 81 e8 00 00 restore =============================================================================== 0200e960 <_POSIX_signals_Clear_process_signals>: */ void _POSIX_signals_Clear_process_signals( int signo ) { 200e960: 9d e3 bf a0 save %sp, -96, %sp clear_signal = true; mask = signo_to_mask( signo ); ISR_Level level; _ISR_Disable( level ); 200e964: 7f ff ce 06 call 200217c 200e968: 01 00 00 00 nop if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { 200e96c: 85 2e 20 04 sll %i0, 4, %g2 200e970: 83 2e 20 02 sll %i0, 2, %g1 200e974: 82 20 80 01 sub %g2, %g1, %g1 200e978: 05 00 80 73 sethi %hi(0x201cc00), %g2 200e97c: 84 10 a3 50 or %g2, 0x350, %g2 ! 201cf50 <_POSIX_signals_Vectors> 200e980: c4 00 80 01 ld [ %g2 + %g1 ], %g2 200e984: 80 a0 a0 02 cmp %g2, 2 200e988: 12 80 00 0a bne 200e9b0 <_POSIX_signals_Clear_process_signals+0x50> 200e98c: 84 10 20 01 mov 1, %g2 if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) 200e990: 05 00 80 74 sethi %hi(0x201d000), %g2 200e994: 84 10 a1 48 or %g2, 0x148, %g2 ! 201d148 <_POSIX_signals_Siginfo> 200e998: 86 00 40 02 add %g1, %g2, %g3 200e99c: 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 ); 200e9a0: 86 00 e0 04 add %g3, 4, %g3 200e9a4: 80 a0 40 03 cmp %g1, %g3 200e9a8: 12 80 00 08 bne 200e9c8 <_POSIX_signals_Clear_process_signals+0x68><== NEVER TAKEN 200e9ac: 84 10 20 01 mov 1, %g2 clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; 200e9b0: 03 00 80 74 sethi %hi(0x201d000), %g1 200e9b4: b0 06 3f ff add %i0, -1, %i0 200e9b8: b1 28 80 18 sll %g2, %i0, %i0 200e9bc: c4 00 61 44 ld [ %g1 + 0x144 ], %g2 200e9c0: b0 28 80 18 andn %g2, %i0, %i0 200e9c4: f0 20 61 44 st %i0, [ %g1 + 0x144 ] } _ISR_Enable( level ); 200e9c8: 7f ff cd f1 call 200218c 200e9cc: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02006b5c <_POSIX_signals_Get_lowest>: sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 2006b5c: 82 10 20 1b mov 0x1b, %g1 2006b60: 84 10 20 01 mov 1, %g2 #include #include #include #include int _POSIX_signals_Get_lowest( 2006b64: 86 00 7f ff add %g1, -1, %g3 2006b68: 87 28 80 03 sll %g2, %g3, %g3 ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 2006b6c: 80 88 c0 08 btst %g3, %o0 2006b70: 12 80 00 11 bne 2006bb4 <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN 2006b74: 01 00 00 00 nop sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 2006b78: 82 00 60 01 inc %g1 2006b7c: 80 a0 60 20 cmp %g1, 0x20 2006b80: 12 bf ff fa bne 2006b68 <_POSIX_signals_Get_lowest+0xc> 2006b84: 86 00 7f ff add %g1, -1, %g3 2006b88: 82 10 20 01 mov 1, %g1 2006b8c: 84 10 20 01 mov 1, %g2 #include #include #include #include int _POSIX_signals_Get_lowest( 2006b90: 86 00 7f ff add %g1, -1, %g3 2006b94: 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 ) ) { 2006b98: 80 88 c0 08 btst %g3, %o0 2006b9c: 12 80 00 06 bne 2006bb4 <_POSIX_signals_Get_lowest+0x58> 2006ba0: 01 00 00 00 nop */ #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 2006ba4: 82 00 60 01 inc %g1 2006ba8: 80 a0 60 1b cmp %g1, 0x1b 2006bac: 12 bf ff fa bne 2006b94 <_POSIX_signals_Get_lowest+0x38> <== ALWAYS TAKEN 2006bb0: 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; } 2006bb4: 81 c3 e0 08 retl 2006bb8: 90 10 00 01 mov %g1, %o0 =============================================================================== 020196e8 <_POSIX_signals_Unblock_thread>: bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 20196e8: 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 ) ) { 20196ec: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 20196f0: 3b 04 00 20 sethi %hi(0x10008000), %i5 static inline sigset_t signo_to_mask( uint32_t sig ) { return 1u << (sig - 1); 20196f4: 84 06 7f ff add %i1, -1, %g2 20196f8: 86 10 20 01 mov 1, %g3 20196fc: 9e 08 40 1d and %g1, %i5, %o7 bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 2019700: 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 ]; 2019704: 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 ) ) { 2019708: 80 a3 c0 1d cmp %o7, %i5 201970c: 12 80 00 1c bne 201977c <_POSIX_signals_Unblock_thread+0x94> 2019710: 85 28 c0 02 sll %g3, %g2, %g2 if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) { 2019714: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 2019718: 80 88 80 01 btst %g2, %g1 201971c: 12 80 00 07 bne 2019738 <_POSIX_signals_Unblock_thread+0x50> 2019720: 82 10 20 04 mov 4, %g1 2019724: c2 01 20 d0 ld [ %g4 + 0xd0 ], %g1 2019728: 80 a8 80 01 andncc %g2, %g1, %g0 201972c: 02 80 00 3f be 2019828 <_POSIX_signals_Unblock_thread+0x140> 2019730: ba 10 20 00 clr %i5 the_thread->Wait.return_code = EINTR; 2019734: 82 10 20 04 mov 4, %g1 2019738: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { 201973c: 80 a2 60 00 cmp %o1, 0 2019740: 12 80 00 07 bne 201975c <_POSIX_signals_Unblock_thread+0x74> 2019744: d0 06 20 28 ld [ %i0 + 0x28 ], %o0 the_info->si_signo = signo; the_info->si_code = SI_USER; 2019748: 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; 201974c: f2 22 00 00 st %i1, [ %o0 ] the_info->si_code = SI_USER; 2019750: c2 22 20 04 st %g1, [ %o0 + 4 ] the_info->si_value.sival_int = 0; 2019754: 10 80 00 04 b 2019764 <_POSIX_signals_Unblock_thread+0x7c> 2019758: c0 22 20 08 clr [ %o0 + 8 ] } else { *the_info = *info; 201975c: 7f ff d7 06 call 200f374 2019760: 94 10 20 0c mov 0xc, %o2 } _Thread_queue_Extract_with_proxy( the_thread ); 2019764: 90 10 00 18 mov %i0, %o0 2019768: 7f ff bf 24 call 20093f8 <_Thread_queue_Extract_with_proxy> 201976c: ba 10 20 01 mov 1, %i5 2019770: b0 0f 60 01 and %i5, 1, %i0 2019774: 81 c7 e0 08 ret 2019778: 81 e8 00 00 restore } /* * Thread is not waiting due to a sigwait. */ if ( ~api->signals_blocked & mask ) { 201977c: c8 01 20 d0 ld [ %g4 + 0xd0 ], %g4 2019780: 80 a8 80 04 andncc %g2, %g4, %g0 2019784: 02 80 00 29 be 2019828 <_POSIX_signals_Unblock_thread+0x140> 2019788: 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 ) ) { 201978c: 05 04 00 00 sethi %hi(0x10000000), %g2 2019790: 80 88 40 02 btst %g1, %g2 2019794: 02 80 00 19 be 20197f8 <_POSIX_signals_Unblock_thread+0x110> 2019798: 80 a0 60 00 cmp %g1, 0 the_thread->Wait.return_code = EINTR; 201979c: 84 10 20 04 mov 4, %g2 20197a0: 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) ) 20197a4: 05 00 00 ef sethi %hi(0x3bc00), %g2 20197a8: 84 10 a2 e0 or %g2, 0x2e0, %g2 ! 3bee0 20197ac: 80 88 40 02 btst %g1, %g2 20197b0: 02 80 00 07 be 20197cc <_POSIX_signals_Unblock_thread+0xe4> 20197b4: 80 88 60 08 btst 8, %g1 _Thread_queue_Extract_with_proxy( the_thread ); 20197b8: 7f ff bf 10 call 20093f8 <_Thread_queue_Extract_with_proxy> 20197bc: 90 10 00 18 mov %i0, %o0 20197c0: b0 0f 60 01 and %i5, 1, %i0 20197c4: 81 c7 e0 08 ret 20197c8: 81 e8 00 00 restore else if ( _States_Is_delaying(the_thread->current_state) ) { 20197cc: 22 80 00 18 be,a 201982c <_POSIX_signals_Unblock_thread+0x144><== NEVER TAKEN 20197d0: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED (void) _Watchdog_Remove( &the_thread->Timer ); 20197d4: 7f ff c1 0f call 2009c10 <_Watchdog_Remove> 20197d8: 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 ); 20197dc: 90 10 00 18 mov %i0, %o0 20197e0: 13 04 00 ff sethi %hi(0x1003fc00), %o1 20197e4: 7f ff bc 5d call 2008958 <_Thread_Clear_state> 20197e8: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 20197ec: b0 0f 60 01 and %i5, 1, %i0 20197f0: 81 c7 e0 08 ret 20197f4: 81 e8 00 00 restore _Thread_Unblock( the_thread ); } } else if ( the_thread->current_state == STATES_READY ) { 20197f8: 32 80 00 0d bne,a 201982c <_POSIX_signals_Unblock_thread+0x144><== NEVER TAKEN 20197fc: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 2019800: 03 00 80 73 sethi %hi(0x201cc00), %g1 2019804: 82 10 62 f8 or %g1, 0x2f8, %g1 ! 201cef8 <_Per_CPU_Information> 2019808: c4 00 60 08 ld [ %g1 + 8 ], %g2 201980c: 80 a0 a0 00 cmp %g2, 0 2019810: 22 80 00 07 be,a 201982c <_POSIX_signals_Unblock_thread+0x144> 2019814: b0 0f 60 01 and %i5, 1, %i0 2019818: c4 00 60 0c ld [ %g1 + 0xc ], %g2 201981c: 80 a6 00 02 cmp %i0, %g2 2019820: 22 80 00 02 be,a 2019828 <_POSIX_signals_Unblock_thread+0x140><== ALWAYS TAKEN 2019824: c6 28 60 18 stb %g3, [ %g1 + 0x18 ] _Thread_Dispatch_necessary = true; } } return false; } 2019828: b0 0f 60 01 and %i5, 1, %i0 201982c: 81 c7 e0 08 ret 2019830: 81 e8 00 00 restore =============================================================================== 020089b4 <_RBTree_Extract_unprotected>: */ void _RBTree_Extract_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 20089b4: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *leaf, *target; RBTree_Color victim_color; RBTree_Direction dir; if(!the_node) return; 20089b8: 80 a6 60 00 cmp %i1, 0 20089bc: 02 80 00 7b be 2008ba8 <_RBTree_Extract_unprotected+0x1f4> 20089c0: 01 00 00 00 nop /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { 20089c4: c2 06 20 08 ld [ %i0 + 8 ], %g1 20089c8: 80 a6 40 01 cmp %i1, %g1 20089cc: 32 80 00 0d bne,a 2008a00 <_RBTree_Extract_unprotected+0x4c> 20089d0: c2 06 20 0c ld [ %i0 + 0xc ], %g1 if (the_node->child[RBT_RIGHT]) 20089d4: c2 06 60 08 ld [ %i1 + 8 ], %g1 20089d8: 80 a0 60 00 cmp %g1, 0 20089dc: 22 80 00 04 be,a 20089ec <_RBTree_Extract_unprotected+0x38> 20089e0: c2 06 40 00 ld [ %i1 ], %g1 the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT]; 20089e4: 10 80 00 06 b 20089fc <_RBTree_Extract_unprotected+0x48> 20089e8: 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, 20089ec: 80 a6 00 01 cmp %i0, %g1 20089f0: 12 80 00 03 bne 20089fc <_RBTree_Extract_unprotected+0x48> 20089f4: c2 26 20 08 st %g1, [ %i0 + 8 ] the_rbtree->first[RBT_LEFT])) the_rbtree->first[RBT_LEFT] = NULL; 20089f8: 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]) { 20089fc: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2008a00: 80 a6 40 01 cmp %i1, %g1 2008a04: 12 80 00 0b bne 2008a30 <_RBTree_Extract_unprotected+0x7c> 2008a08: c2 06 60 04 ld [ %i1 + 4 ], %g1 if (the_node->child[RBT_LEFT]) 2008a0c: 80 a0 60 00 cmp %g1, 0 2008a10: 22 80 00 04 be,a 2008a20 <_RBTree_Extract_unprotected+0x6c> 2008a14: c4 06 40 00 ld [ %i1 ], %g2 the_rbtree->first[RBT_RIGHT] = the_node->child[RBT_LEFT]; 2008a18: 10 80 00 06 b 2008a30 <_RBTree_Extract_unprotected+0x7c> 2008a1c: 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, 2008a20: 80 a6 00 02 cmp %i0, %g2 2008a24: 12 80 00 03 bne 2008a30 <_RBTree_Extract_unprotected+0x7c> 2008a28: c4 26 20 0c st %g2, [ %i0 + 0xc ] the_rbtree->first[RBT_RIGHT])) the_rbtree->first[RBT_RIGHT] = NULL; 2008a2c: 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]) { 2008a30: ba 90 60 00 orcc %g1, 0, %i5 2008a34: 02 80 00 36 be 2008b0c <_RBTree_Extract_unprotected+0x158> 2008a38: f8 06 60 08 ld [ %i1 + 8 ], %i4 2008a3c: 80 a7 20 00 cmp %i4, 0 2008a40: 32 80 00 05 bne,a 2008a54 <_RBTree_Extract_unprotected+0xa0> 2008a44: c2 07 60 08 ld [ %i5 + 8 ], %g1 2008a48: 10 80 00 35 b 2008b1c <_RBTree_Extract_unprotected+0x168> 2008a4c: 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]; 2008a50: c2 07 60 08 ld [ %i5 + 8 ], %g1 2008a54: 80 a0 60 00 cmp %g1, 0 2008a58: 32 bf ff fe bne,a 2008a50 <_RBTree_Extract_unprotected+0x9c> 2008a5c: 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]; 2008a60: f8 07 60 04 ld [ %i5 + 4 ], %i4 if(leaf) { 2008a64: 80 a7 20 00 cmp %i4, 0 2008a68: 02 80 00 05 be 2008a7c <_RBTree_Extract_unprotected+0xc8> <== ALWAYS TAKEN 2008a6c: 01 00 00 00 nop leaf->parent = target->parent; 2008a70: c2 07 40 00 ld [ %i5 ], %g1 <== NOT EXECUTED 2008a74: 10 80 00 04 b 2008a84 <_RBTree_Extract_unprotected+0xd0> <== NOT EXECUTED 2008a78: c2 27 00 00 st %g1, [ %i4 ] <== NOT EXECUTED } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); 2008a7c: 7f ff ff 50 call 20087bc <_RBTree_Extract_validate_unprotected> 2008a80: 90 10 00 1d mov %i5, %o0 } victim_color = target->color; dir = target != target->parent->child[0]; 2008a84: 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; 2008a88: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 dir = target != target->parent->child[0]; 2008a8c: c6 00 a0 04 ld [ %g2 + 4 ], %g3 2008a90: 86 1f 40 03 xor %i5, %g3, %g3 2008a94: 80 a0 00 03 cmp %g0, %g3 2008a98: 86 40 20 00 addx %g0, 0, %g3 target->parent->child[dir] = leaf; 2008a9c: 87 28 e0 02 sll %g3, 2, %g3 2008aa0: 84 00 80 03 add %g2, %g3, %g2 2008aa4: f8 20 a0 04 st %i4, [ %g2 + 4 ] /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 2008aa8: c4 06 40 00 ld [ %i1 ], %g2 2008aac: c6 00 a0 04 ld [ %g2 + 4 ], %g3 2008ab0: 86 1e 40 03 xor %i1, %g3, %g3 2008ab4: 80 a0 00 03 cmp %g0, %g3 2008ab8: 86 40 20 00 addx %g0, 0, %g3 the_node->parent->child[dir] = target; 2008abc: 87 28 e0 02 sll %g3, 2, %g3 2008ac0: 84 00 80 03 add %g2, %g3, %g2 2008ac4: 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]; 2008ac8: c4 06 60 08 ld [ %i1 + 8 ], %g2 2008acc: c4 27 60 08 st %g2, [ %i5 + 8 ] if (the_node->child[RBT_RIGHT]) 2008ad0: c4 06 60 08 ld [ %i1 + 8 ], %g2 2008ad4: 80 a0 a0 00 cmp %g2, 0 2008ad8: 32 80 00 02 bne,a 2008ae0 <_RBTree_Extract_unprotected+0x12c><== ALWAYS TAKEN 2008adc: fa 20 80 00 st %i5, [ %g2 ] the_node->child[RBT_RIGHT]->parent = target; target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 2008ae0: c4 06 60 04 ld [ %i1 + 4 ], %g2 2008ae4: c4 27 60 04 st %g2, [ %i5 + 4 ] if (the_node->child[RBT_LEFT]) 2008ae8: c4 06 60 04 ld [ %i1 + 4 ], %g2 2008aec: 80 a0 a0 00 cmp %g2, 0 2008af0: 32 80 00 02 bne,a 2008af8 <_RBTree_Extract_unprotected+0x144> 2008af4: 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; 2008af8: c4 06 40 00 ld [ %i1 ], %g2 2008afc: c4 27 40 00 st %g2, [ %i5 ] target->color = the_node->color; 2008b00: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 2008b04: 10 80 00 14 b 2008b54 <_RBTree_Extract_unprotected+0x1a0> 2008b08: c4 27 60 10 st %g2, [ %i5 + 0x10 ] * 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 ) { 2008b0c: 80 a7 20 00 cmp %i4, 0 2008b10: 32 80 00 04 bne,a 2008b20 <_RBTree_Extract_unprotected+0x16c> 2008b14: c2 06 40 00 ld [ %i1 ], %g1 2008b18: 30 80 00 04 b,a 2008b28 <_RBTree_Extract_unprotected+0x174> leaf->parent = the_node->parent; 2008b1c: c2 06 40 00 ld [ %i1 ], %g1 2008b20: 10 80 00 04 b 2008b30 <_RBTree_Extract_unprotected+0x17c> 2008b24: 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); 2008b28: 7f ff ff 25 call 20087bc <_RBTree_Extract_validate_unprotected> 2008b2c: 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]; 2008b30: 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; 2008b34: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 2008b38: c6 00 a0 04 ld [ %g2 + 4 ], %g3 2008b3c: 86 1e 40 03 xor %i1, %g3, %g3 2008b40: 80 a0 00 03 cmp %g0, %g3 2008b44: 86 40 20 00 addx %g0, 0, %g3 the_node->parent->child[dir] = leaf; 2008b48: 87 28 e0 02 sll %g3, 2, %g3 2008b4c: 84 00 80 03 add %g2, %g3, %g2 2008b50: f8 20 a0 04 st %i4, [ %g2 + 4 ] * 1. Deleted a red node, its child must be black. Nothing must be done. * 2. Deleted a black node and the child is red. Paint child black. * 3. Deleted a black node and its child is black. This requires some * care and rotations. */ if (victim_color == RBT_BLACK) { /* eliminate case 1 */ 2008b54: 80 a0 60 00 cmp %g1, 0 2008b58: 32 80 00 0e bne,a 2008b90 <_RBTree_Extract_unprotected+0x1dc> 2008b5c: c2 06 20 04 ld [ %i0 + 4 ], %g1 2008b60: 80 a7 20 00 cmp %i4, 0 2008b64: 22 80 00 0b be,a 2008b90 <_RBTree_Extract_unprotected+0x1dc> 2008b68: c2 06 20 04 ld [ %i0 + 4 ], %g1 2008b6c: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 2008b70: 80 a0 60 01 cmp %g1, 1 2008b74: 12 80 00 04 bne 2008b84 <_RBTree_Extract_unprotected+0x1d0><== NEVER TAKEN 2008b78: 01 00 00 00 nop if (_RBTree_Is_red(leaf)) leaf->color = RBT_BLACK; /* case 2 */ 2008b7c: 10 80 00 04 b 2008b8c <_RBTree_Extract_unprotected+0x1d8> 2008b80: c0 27 20 10 clr [ %i4 + 0x10 ] else if(leaf) _RBTree_Extract_validate_unprotected(leaf); /* case 3 */ 2008b84: 7f ff ff 0e call 20087bc <_RBTree_Extract_validate_unprotected><== NOT EXECUTED 2008b88: 90 10 00 1c mov %i4, %o0 <== NOT EXECUTED /* Wipe the_node */ _RBTree_Set_off_rbtree(the_node); /* set root to black, if it exists */ if (the_rbtree->root) the_rbtree->root->color = RBT_BLACK; 2008b8c: 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; 2008b90: c0 26 60 08 clr [ %i1 + 8 ] 2008b94: c0 26 60 04 clr [ %i1 + 4 ] 2008b98: 80 a0 60 00 cmp %g1, 0 2008b9c: 02 80 00 03 be 2008ba8 <_RBTree_Extract_unprotected+0x1f4> 2008ba0: c0 26 40 00 clr [ %i1 ] 2008ba4: c0 20 60 10 clr [ %g1 + 0x10 ] 2008ba8: 81 c7 e0 08 ret 2008bac: 81 e8 00 00 restore =============================================================================== 020087bc <_RBTree_Extract_validate_unprotected>: * of the extract operation. */ void _RBTree_Extract_validate_unprotected( RBTree_Node *the_node ) { 20087bc: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *parent, *sibling; RBTree_Direction dir; parent = the_node->parent; 20087c0: fa 06 00 00 ld [ %i0 ], %i5 if(!parent->parent) return; 20087c4: c2 07 40 00 ld [ %i5 ], %g1 20087c8: 80 a0 60 00 cmp %g1, 0 20087cc: 02 80 00 71 be 2008990 <_RBTree_Extract_validate_unprotected+0x1d4> 20087d0: 90 10 00 18 mov %i0, %o0 sibling = _RBTree_Sibling(the_node); 20087d4: 7f ff ff ca call 20086fc <_RBTree_Sibling> 20087d8: 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) { 20087dc: 10 80 00 60 b 200895c <_RBTree_Extract_validate_unprotected+0x1a0> 20087e0: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 20087e4: 22 80 00 5e be,a 200895c <_RBTree_Extract_validate_unprotected+0x1a0><== NEVER TAKEN 20087e8: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 <== NOT EXECUTED 20087ec: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 20087f0: 80 a0 60 01 cmp %g1, 1 20087f4: 32 80 00 14 bne,a 2008844 <_RBTree_Extract_validate_unprotected+0x88> 20087f8: 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; 20087fc: c2 27 60 10 st %g1, [ %i5 + 0x10 ] sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 2008800: 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; 2008804: c0 22 20 10 clr [ %o0 + 0x10 ] dir = the_node != parent->child[0]; 2008808: 82 1e 00 01 xor %i0, %g1, %g1 200880c: 80 a0 00 01 cmp %g0, %g1 _RBTree_Rotate(parent, dir); 2008810: 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]; 2008814: b8 40 20 00 addx %g0, 0, %i4 _RBTree_Rotate(parent, dir); 2008818: 7f ff ff ca call 2008740 <_RBTree_Rotate> 200881c: 92 10 00 1c mov %i4, %o1 sibling = parent->child[!dir]; 2008820: 80 a0 00 1c cmp %g0, %i4 2008824: 82 60 3f ff subx %g0, -1, %g1 2008828: 83 28 60 02 sll %g1, 2, %g1 200882c: 82 07 40 01 add %i5, %g1, %g1 2008830: d0 00 60 04 ld [ %g1 + 4 ], %o0 } /* sibling is black, see if both of its children are also black. */ if (sibling && 2008834: 80 a2 20 00 cmp %o0, 0 2008838: 22 80 00 49 be,a 200895c <_RBTree_Extract_validate_unprotected+0x1a0><== NEVER TAKEN 200883c: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 <== NOT EXECUTED !_RBTree_Is_red(sibling->child[RBT_RIGHT]) && 2008840: c4 02 20 08 ld [ %o0 + 8 ], %g2 2008844: 80 a0 a0 00 cmp %g2, 0 2008848: 02 80 00 06 be 2008860 <_RBTree_Extract_validate_unprotected+0xa4> 200884c: 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( 2008850: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 2008854: 82 18 60 01 xor %g1, 1, %g1 2008858: 80 a0 00 01 cmp %g0, %g1 200885c: 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 (sibling && 2008860: 80 a0 60 00 cmp %g1, 0 2008864: 32 80 00 14 bne,a 20088b4 <_RBTree_Extract_validate_unprotected+0xf8> 2008868: c2 07 60 04 ld [ %i5 + 4 ], %g1 !_RBTree_Is_red(sibling->child[RBT_RIGHT]) && !_RBTree_Is_red(sibling->child[RBT_LEFT])) { 200886c: c4 02 20 04 ld [ %o0 + 4 ], %g2 2008870: 80 a0 a0 00 cmp %g2, 0 2008874: 02 80 00 07 be 2008890 <_RBTree_Extract_validate_unprotected+0xd4> 2008878: 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( 200887c: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 2008880: 82 18 60 01 xor %g1, 1, %g1 2008884: 80 a0 00 01 cmp %g0, %g1 2008888: 82 60 3f ff subx %g0, -1, %g1 sibling = parent->child[!dir]; } /* sibling is black, see if both of its children are also black. */ if (sibling && !_RBTree_Is_red(sibling->child[RBT_RIGHT]) && 200888c: 80 a0 60 00 cmp %g1, 0 2008890: 32 80 00 09 bne,a 20088b4 <_RBTree_Extract_validate_unprotected+0xf8> 2008894: c2 07 60 04 ld [ %i5 + 4 ], %g1 !_RBTree_Is_red(sibling->child[RBT_LEFT])) { sibling->color = RBT_RED; 2008898: f4 22 20 10 st %i2, [ %o0 + 0x10 ] 200889c: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 20088a0: 80 a0 60 01 cmp %g1, 1 20088a4: 32 80 00 3d bne,a 2008998 <_RBTree_Extract_validate_unprotected+0x1dc> 20088a8: f8 07 40 00 ld [ %i5 ], %i4 if (_RBTree_Is_red(parent)) { parent->color = RBT_BLACK; break; 20088ac: 10 80 00 33 b 2008978 <_RBTree_Extract_validate_unprotected+0x1bc> 20088b0: c0 27 60 10 clr [ %i5 + 0x10 ] * 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]; 20088b4: 82 1e 00 01 xor %i0, %g1, %g1 20088b8: 80 a0 00 01 cmp %g0, %g1 20088bc: b8 40 20 00 addx %g0, 0, %i4 if (!_RBTree_Is_red(sibling->child[!dir])) { 20088c0: 80 a0 00 1c cmp %g0, %i4 20088c4: b6 60 3f ff subx %g0, -1, %i3 20088c8: 83 2e e0 02 sll %i3, 2, %g1 20088cc: 82 02 00 01 add %o0, %g1, %g1 20088d0: c4 00 60 04 ld [ %g1 + 4 ], %g2 20088d4: 80 a0 a0 00 cmp %g2, 0 20088d8: 02 80 00 06 be 20088f0 <_RBTree_Extract_validate_unprotected+0x134> 20088dc: 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( 20088e0: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 20088e4: 82 18 60 01 xor %g1, 1, %g1 20088e8: 80 a0 00 01 cmp %g0, %g1 20088ec: 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])) { 20088f0: 80 a0 60 00 cmp %g1, 0 20088f4: 32 80 00 0e bne,a 200892c <_RBTree_Extract_validate_unprotected+0x170> 20088f8: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 sibling->color = RBT_RED; 20088fc: 82 10 20 01 mov 1, %g1 2008900: c2 22 20 10 st %g1, [ %o0 + 0x10 ] sibling->child[dir]->color = RBT_BLACK; 2008904: 83 2f 20 02 sll %i4, 2, %g1 2008908: 82 02 00 01 add %o0, %g1, %g1 200890c: c2 00 60 04 ld [ %g1 + 4 ], %g1 _RBTree_Rotate(sibling, !dir); 2008910: 92 1f 20 01 xor %i4, 1, %o1 2008914: 7f ff ff 8b call 2008740 <_RBTree_Rotate> 2008918: c0 20 60 10 clr [ %g1 + 0x10 ] sibling = parent->child[!dir]; 200891c: 83 2e e0 02 sll %i3, 2, %g1 2008920: 82 07 40 01 add %i5, %g1, %g1 2008924: d0 00 60 04 ld [ %g1 + 4 ], %o0 } sibling->color = parent->color; 2008928: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 parent->color = RBT_BLACK; sibling->child[!dir]->color = RBT_BLACK; 200892c: 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; 2008930: c2 22 20 10 st %g1, [ %o0 + 0x10 ] parent->color = RBT_BLACK; sibling->child[!dir]->color = RBT_BLACK; 2008934: 90 02 00 1b add %o0, %i3, %o0 2008938: 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; 200893c: c0 27 60 10 clr [ %i5 + 0x10 ] sibling->child[!dir]->color = RBT_BLACK; 2008940: c0 20 60 10 clr [ %g1 + 0x10 ] _RBTree_Rotate(parent, dir); 2008944: 90 10 00 1d mov %i5, %o0 2008948: 7f ff ff 7e call 2008740 <_RBTree_Rotate> 200894c: 92 10 00 1c mov %i4, %o1 break; /* done */ 2008950: 10 80 00 0b b 200897c <_RBTree_Extract_validate_unprotected+0x1c0> 2008954: 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) { 2008958: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 200895c: 80 a0 60 01 cmp %g1, 1 2008960: 22 80 00 07 be,a 200897c <_RBTree_Extract_validate_unprotected+0x1c0> 2008964: c2 06 00 00 ld [ %i0 ], %g1 2008968: c2 07 40 00 ld [ %i5 ], %g1 200896c: 80 a0 60 00 cmp %g1, 0 2008970: 12 bf ff 9d bne 20087e4 <_RBTree_Extract_validate_unprotected+0x28> 2008974: 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; 2008978: c2 06 00 00 ld [ %i0 ], %g1 200897c: c2 00 40 00 ld [ %g1 ], %g1 2008980: 80 a0 60 00 cmp %g1, 0 2008984: 12 80 00 0a bne 20089ac <_RBTree_Extract_validate_unprotected+0x1f0> 2008988: 01 00 00 00 nop 200898c: c0 26 20 10 clr [ %i0 + 0x10 ] 2008990: 81 c7 e0 08 ret 2008994: 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); 2008998: 90 10 00 1d mov %i5, %o0 200899c: 7f ff ff 58 call 20086fc <_RBTree_Sibling> 20089a0: b0 10 00 1d mov %i5, %i0 20089a4: 10 bf ff ed b 2008958 <_RBTree_Extract_validate_unprotected+0x19c> 20089a8: ba 10 00 1c mov %i4, %i5 20089ac: 81 c7 e0 08 ret 20089b0: 81 e8 00 00 restore =============================================================================== 02008c24 <_RBTree_Find>: RBTree_Node *_RBTree_Find( RBTree_Control *the_rbtree, unsigned int the_value ) { 2008c24: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); 2008c28: 7f ff e7 ed call 2002bdc 2008c2c: 01 00 00 00 nop RBTree_Node* iter_node = the_rbtree->root; while (iter_node) { if (the_value == iter_node->value) return(iter_node); RBTree_Direction dir = the_value > iter_node->value; iter_node = iter_node->child[dir]; 2008c30: 10 80 00 09 b 2008c54 <_RBTree_Find+0x30> 2008c34: f0 06 20 04 ld [ %i0 + 4 ], %i0 unsigned int the_value ) { RBTree_Node* iter_node = the_rbtree->root; while (iter_node) { if (the_value == iter_node->value) return(iter_node); 2008c38: 80 a6 40 01 cmp %i1, %g1 2008c3c: 02 80 00 09 be 2008c60 <_RBTree_Find+0x3c> 2008c40: 80 a0 40 19 cmp %g1, %i1 RBTree_Direction dir = the_value > iter_node->value; 2008c44: 82 40 20 00 addx %g0, 0, %g1 iter_node = iter_node->child[dir]; 2008c48: 83 28 60 02 sll %g1, 2, %g1 2008c4c: b0 06 00 01 add %i0, %g1, %i0 2008c50: f0 06 20 04 ld [ %i0 + 4 ], %i0 RBTree_Control *the_rbtree, unsigned int the_value ) { RBTree_Node* iter_node = the_rbtree->root; while (iter_node) { 2008c54: 80 a6 20 00 cmp %i0, 0 2008c58: 32 bf ff f8 bne,a 2008c38 <_RBTree_Find+0x14> <== ALWAYS TAKEN 2008c5c: c2 06 20 0c ld [ %i0 + 0xc ], %g1 return_node = _RBTree_Find_unprotected( the_rbtree, the_value ); _ISR_Enable( level ); 2008c60: 7f ff e7 e3 call 2002bec 2008c64: 01 00 00 00 nop return return_node; } 2008c68: 81 c7 e0 08 ret 2008c6c: 81 e8 00 00 restore =============================================================================== 02008bd4 <_RBTree_Find_header>: */ RBTree_Control *_RBTree_Find_header( RBTree_Node *the_node ) { 2008bd4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Control *return_header; return_header = NULL; _ISR_Disable( level ); 2008bd8: 7f ff e8 01 call 2002bdc 2008bdc: ba 10 00 18 mov %i0, %i5 */ RTEMS_INLINE_ROUTINE RBTree_Control *_RBTree_Find_header_unprotected( RBTree_Node *the_node ) { if(!the_node) return NULL; 2008be0: 80 a7 60 00 cmp %i5, 0 2008be4: 02 80 00 0c be 2008c14 <_RBTree_Find_header+0x40> <== NEVER TAKEN 2008be8: b0 10 20 00 clr %i0 if(!(the_node->parent)) return NULL; 2008bec: c2 07 40 00 ld [ %i5 ], %g1 2008bf0: 80 a0 60 00 cmp %g1, 0 2008bf4: 32 80 00 03 bne,a 2008c00 <_RBTree_Find_header+0x2c> <== ALWAYS TAKEN 2008bf8: ba 10 00 01 mov %g1, %i5 2008bfc: 30 80 00 06 b,a 2008c14 <_RBTree_Find_header+0x40> <== NOT EXECUTED while(the_node->parent) the_node = the_node->parent; 2008c00: c2 07 40 00 ld [ %i5 ], %g1 2008c04: 80 a0 60 00 cmp %g1, 0 2008c08: 32 bf ff fe bne,a 2008c00 <_RBTree_Find_header+0x2c> 2008c0c: ba 10 00 01 mov %g1, %i5 2008c10: b0 10 00 1d mov %i5, %i0 return_header = _RBTree_Find_header_unprotected( the_node ); _ISR_Enable( level ); 2008c14: 7f ff e7 f6 call 2002bec 2008c18: 01 00 00 00 nop return return_header; } 2008c1c: 81 c7 e0 08 ret 2008c20: 81 e8 00 00 restore =============================================================================== 02008e0c <_RBTree_Insert_unprotected>: */ RBTree_Node *_RBTree_Insert_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 2008e0c: 9d e3 bf a0 save %sp, -96, %sp 2008e10: 82 10 00 18 mov %i0, %g1 2008e14: 90 10 00 19 mov %i1, %o0 if(!the_node) return (RBTree_Node*)-1; 2008e18: 80 a6 60 00 cmp %i1, 0 2008e1c: 02 80 00 0d be 2008e50 <_RBTree_Insert_unprotected+0x44> <== NEVER TAKEN 2008e20: b0 10 3f ff mov -1, %i0 RBTree_Node *iter_node = the_rbtree->root; 2008e24: f0 00 60 04 ld [ %g1 + 4 ], %i0 if (!iter_node) { /* special case: first node inserted */ 2008e28: 80 a6 20 00 cmp %i0, 0 2008e2c: 32 80 00 1f bne,a 2008ea8 <_RBTree_Insert_unprotected+0x9c> 2008e30: c4 06 60 0c ld [ %i1 + 0xc ], %g2 the_node->color = RBT_BLACK; 2008e34: c0 26 60 10 clr [ %i1 + 0x10 ] the_rbtree->root = the_node; 2008e38: f2 20 60 04 st %i1, [ %g1 + 4 ] the_rbtree->first[0] = the_rbtree->first[1] = the_node; 2008e3c: f2 20 60 0c st %i1, [ %g1 + 0xc ] 2008e40: f2 20 60 08 st %i1, [ %g1 + 8 ] the_node->parent = (RBTree_Node *) the_rbtree; 2008e44: c2 26 40 00 st %g1, [ %i1 ] the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 2008e48: c0 26 60 08 clr [ %i1 + 8 ] 2008e4c: c0 26 60 04 clr [ %i1 + 4 ] 2008e50: 81 c7 e0 08 ret 2008e54: 81 e8 00 00 restore } else { /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); RBTree_Direction dir = the_node->value > iter_node->value; 2008e58: 86 40 20 00 addx %g0, 0, %g3 if (!iter_node->child[dir]) { 2008e5c: 89 28 e0 02 sll %g3, 2, %g4 2008e60: 88 06 00 04 add %i0, %g4, %g4 2008e64: de 01 20 04 ld [ %g4 + 4 ], %o7 2008e68: 80 a3 e0 00 cmp %o7, 0 2008e6c: 32 80 00 0f bne,a 2008ea8 <_RBTree_Insert_unprotected+0x9c> 2008e70: b0 10 00 0f mov %o7, %i0 the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; 2008e74: 84 10 20 01 mov 1, %g2 /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); RBTree_Direction dir = the_node->value > iter_node->value; if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 2008e78: c0 22 20 08 clr [ %o0 + 8 ] 2008e7c: c0 22 20 04 clr [ %o0 + 4 ] the_node->color = RBT_RED; 2008e80: c4 22 20 10 st %g2, [ %o0 + 0x10 ] RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_First( RBTree_Control *the_rbtree, RBTree_Direction dir ) { return the_rbtree->first[dir]; 2008e84: 84 00 e0 02 add %g3, 2, %g2 2008e88: 85 28 a0 02 sll %g2, 2, %g2 iter_node->child[dir] = the_node; the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { 2008e8c: c6 00 40 02 ld [ %g1 + %g2 ], %g3 if(the_node->value == iter_node->value) return(iter_node); RBTree_Direction dir = the_node->value > iter_node->value; if (!iter_node->child[dir]) { the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; iter_node->child[dir] = the_node; 2008e90: d0 21 20 04 st %o0, [ %g4 + 4 ] the_node->parent = iter_node; /* update min/max */ if (_RBTree_Is_first(the_rbtree, iter_node, dir)) { 2008e94: 80 a6 00 03 cmp %i0, %g3 2008e98: 12 80 00 0a bne 2008ec0 <_RBTree_Insert_unprotected+0xb4> 2008e9c: f0 22 00 00 st %i0, [ %o0 ] the_rbtree->first[dir] = the_node; 2008ea0: 10 80 00 08 b 2008ec0 <_RBTree_Insert_unprotected+0xb4> 2008ea4: d0 20 40 02 st %o0, [ %g1 + %g2 ] the_node->parent = (RBTree_Node *) the_rbtree; the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; } else { /* typical binary search tree insert, descend tree to leaf and insert */ while (iter_node) { if(the_node->value == iter_node->value) return(iter_node); 2008ea8: c6 06 20 0c ld [ %i0 + 0xc ], %g3 2008eac: 80 a0 80 03 cmp %g2, %g3 2008eb0: 12 bf ff ea bne 2008e58 <_RBTree_Insert_unprotected+0x4c> 2008eb4: 80 a0 c0 02 cmp %g3, %g2 2008eb8: 81 c7 e0 08 ret 2008ebc: 81 e8 00 00 restore } } /* while(iter_node) */ /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); 2008ec0: 7f ff ff 9a call 2008d28 <_RBTree_Validate_insert_unprotected> 2008ec4: b0 10 20 00 clr %i0 } return (RBTree_Node*)0; } 2008ec8: 81 c7 e0 08 ret 2008ecc: 81 e8 00 00 restore =============================================================================== 02008740 <_RBTree_Rotate>: RBTree_Node *the_node, RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; 2008740: 80 a2 20 00 cmp %o0, 0 2008744: 02 80 00 1c be 20087b4 <_RBTree_Rotate+0x74> <== NEVER TAKEN 2008748: 86 10 20 01 mov 1, %g3 if (the_node->child[(1-dir)] == NULL) return; 200874c: 86 20 c0 09 sub %g3, %o1, %g3 2008750: 87 28 e0 02 sll %g3, 2, %g3 2008754: 86 02 00 03 add %o0, %g3, %g3 2008758: c2 00 e0 04 ld [ %g3 + 4 ], %g1 200875c: 80 a0 60 00 cmp %g1, 0 2008760: 02 80 00 15 be 20087b4 <_RBTree_Rotate+0x74> <== NEVER TAKEN 2008764: 93 2a 60 02 sll %o1, 2, %o1 c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 2008768: 84 00 40 09 add %g1, %o1, %g2 200876c: c8 00 a0 04 ld [ %g2 + 4 ], %g4 2008770: c8 20 e0 04 st %g4, [ %g3 + 4 ] if (c->child[dir]) 2008774: c4 00 a0 04 ld [ %g2 + 4 ], %g2 2008778: 80 a0 a0 00 cmp %g2, 0 200877c: 32 80 00 02 bne,a 2008784 <_RBTree_Rotate+0x44> 2008780: d0 20 80 00 st %o0, [ %g2 ] c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008784: c4 02 00 00 ld [ %o0 ], %g2 the_node->child[(1-dir)] = c->child[dir]; if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; 2008788: 92 00 40 09 add %g1, %o1, %o1 200878c: d0 22 60 04 st %o0, [ %o1 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008790: c6 00 a0 04 ld [ %g2 + 4 ], %g3 c->parent = the_node->parent; 2008794: c4 20 40 00 st %g2, [ %g1 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008798: 86 1a 00 03 xor %o0, %g3, %g3 c->parent = the_node->parent; the_node->parent = c; 200879c: c2 22 00 00 st %g1, [ %o0 ] if (c->child[dir]) c->child[dir]->parent = the_node; c->child[dir] = the_node; the_node->parent->child[the_node != the_node->parent->child[0]] = c; 20087a0: 80 a0 00 03 cmp %g0, %g3 20087a4: 86 40 20 00 addx %g0, 0, %g3 20087a8: 87 28 e0 02 sll %g3, 2, %g3 20087ac: 86 00 80 03 add %g2, %g3, %g3 20087b0: c2 20 e0 04 st %g1, [ %g3 + 4 ] 20087b4: 81 c3 e0 08 retl =============================================================================== 020086fc <_RBTree_Sibling>: */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( RBTree_Node *the_node ) { if(!the_node) return NULL; 20086fc: 80 a2 20 00 cmp %o0, 0 2008700: 02 80 00 0e be 2008738 <_RBTree_Sibling+0x3c> <== NEVER TAKEN 2008704: 82 10 20 00 clr %g1 if(!(the_node->parent)) return NULL; 2008708: c4 02 00 00 ld [ %o0 ], %g2 200870c: 80 a0 a0 00 cmp %g2, 0 2008710: 02 80 00 0a be 2008738 <_RBTree_Sibling+0x3c> <== NEVER TAKEN 2008714: 01 00 00 00 nop if(!(the_node->parent->parent)) return NULL; 2008718: c6 00 80 00 ld [ %g2 ], %g3 200871c: 80 a0 e0 00 cmp %g3, 0 2008720: 02 80 00 06 be 2008738 <_RBTree_Sibling+0x3c> 2008724: 01 00 00 00 nop if(the_node == the_node->parent->child[RBT_LEFT]) 2008728: c2 00 a0 04 ld [ %g2 + 4 ], %g1 200872c: 80 a2 00 01 cmp %o0, %g1 2008730: 22 80 00 02 be,a 2008738 <_RBTree_Sibling+0x3c> 2008734: c2 00 a0 08 ld [ %g2 + 8 ], %g1 return the_node->parent->child[RBT_RIGHT]; else return the_node->parent->child[RBT_LEFT]; } 2008738: 81 c3 e0 08 retl 200873c: 90 10 00 01 mov %g1, %o0 =============================================================================== 02008d28 <_RBTree_Validate_insert_unprotected>: * append operation. */ void _RBTree_Validate_insert_unprotected( RBTree_Node *the_node ) { 2008d28: 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))) { 2008d2c: 10 80 00 1f b 2008da8 <_RBTree_Validate_insert_unprotected+0x80> 2008d30: 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; 2008d34: 80 a0 60 00 cmp %g1, 0 2008d38: 02 80 00 27 be 2008dd4 <_RBTree_Validate_insert_unprotected+0xac><== NEVER TAKEN 2008d3c: 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]) 2008d40: 80 a2 00 01 cmp %o0, %g1 2008d44: 22 80 00 02 be,a 2008d4c <_RBTree_Validate_insert_unprotected+0x24> 2008d48: 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); 2008d4c: 80 a0 60 00 cmp %g1, 0 2008d50: 22 80 00 21 be,a 2008dd4 <_RBTree_Validate_insert_unprotected+0xac> 2008d54: c2 07 60 04 ld [ %i5 + 4 ], %g1 2008d58: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 2008d5c: 80 a0 a0 01 cmp %g2, 1 2008d60: 32 80 00 1d bne,a 2008dd4 <_RBTree_Validate_insert_unprotected+0xac> 2008d64: 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; 2008d68: c0 22 20 10 clr [ %o0 + 0x10 ] u->color = RBT_BLACK; 2008d6c: c0 20 60 10 clr [ %g1 + 0x10 ] g->color = RBT_RED; 2008d70: c4 27 60 10 st %g2, [ %i5 + 0x10 ] 2008d74: 10 80 00 0d b 2008da8 <_RBTree_Validate_insert_unprotected+0x80> 2008d78: 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); 2008d7c: 7f ff ff cc call 2008cac <_RBTree_Rotate> 2008d80: 92 10 00 1c mov %i4, %o1 the_node = the_node->child[pdir]; 2008d84: 83 2f 20 02 sll %i4, 2, %g1 2008d88: b0 06 00 01 add %i0, %g1, %i0 2008d8c: f0 06 20 04 ld [ %i0 + 4 ], %i0 } the_node->parent->color = RBT_BLACK; 2008d90: 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)); 2008d94: 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; 2008d98: c0 20 60 10 clr [ %g1 + 0x10 ] g->color = RBT_RED; 2008d9c: f6 27 60 10 st %i3, [ %i5 + 0x10 ] /* now rotate grandparent in the other branch direction (toward uncle) */ _RBTree_Rotate(g, (1-pdir)); 2008da0: 7f ff ff c3 call 2008cac <_RBTree_Rotate> 2008da4: 92 26 c0 1c sub %i3, %i4, %o1 ISR_Level level; _ISR_Disable( level ); _RBTree_Insert_unprotected( tree, node ); _ISR_Enable( level ); } 2008da8: 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; 2008dac: fa 02 00 00 ld [ %o0 ], %i5 2008db0: 80 a7 60 00 cmp %i5, 0 2008db4: 22 80 00 14 be,a 2008e04 <_RBTree_Validate_insert_unprotected+0xdc> 2008db8: c0 26 20 10 clr [ %i0 + 0x10 ] */ RTEMS_INLINE_ROUTINE bool _RBTree_Is_red( const RBTree_Node *the_node ) { return (the_node && the_node->color == RBT_RED); 2008dbc: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 2008dc0: 80 a0 60 01 cmp %g1, 1 2008dc4: 12 80 00 10 bne 2008e04 <_RBTree_Validate_insert_unprotected+0xdc> 2008dc8: 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; 2008dcc: 10 bf ff da b 2008d34 <_RBTree_Validate_insert_unprotected+0xc> 2008dd0: 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]; 2008dd4: 82 1a 00 01 xor %o0, %g1, %g1 2008dd8: 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]; 2008ddc: c2 02 20 04 ld [ %o0 + 4 ], %g1 RBTree_Direction pdir = the_node->parent != g->child[0]; 2008de0: 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]; 2008de4: 82 1e 00 01 xor %i0, %g1, %g1 2008de8: 80 a0 00 01 cmp %g0, %g1 2008dec: 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) { 2008df0: 80 a0 40 1c cmp %g1, %i4 2008df4: 12 bf ff e2 bne 2008d7c <_RBTree_Validate_insert_unprotected+0x54> 2008df8: 01 00 00 00 nop _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; } the_node->parent->color = RBT_BLACK; 2008dfc: 10 bf ff e6 b 2008d94 <_RBTree_Validate_insert_unprotected+0x6c> 2008e00: c2 06 00 00 ld [ %i0 ], %g1 2008e04: 81 c7 e0 08 ret 2008e08: 81 e8 00 00 restore =============================================================================== 02007698 <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 2007698: 9d e3 bf 98 save %sp, -104, %sp 200769c: 11 00 80 79 sethi %hi(0x201e400), %o0 20076a0: 92 10 00 18 mov %i0, %o1 20076a4: 90 12 23 04 or %o0, 0x304, %o0 20076a8: 40 00 07 e3 call 2009634 <_Objects_Get> 20076ac: 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 ) { 20076b0: c2 07 bf fc ld [ %fp + -4 ], %g1 20076b4: 80 a0 60 00 cmp %g1, 0 20076b8: 12 80 00 25 bne 200774c <_Rate_monotonic_Timeout+0xb4> <== NEVER TAKEN 20076bc: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: the_thread = the_period->owner; 20076c0: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 20076c4: 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); 20076c8: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 20076cc: 80 88 80 01 btst %g2, %g1 20076d0: 22 80 00 0b be,a 20076fc <_Rate_monotonic_Timeout+0x64> 20076d4: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 20076d8: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 20076dc: c2 07 60 08 ld [ %i5 + 8 ], %g1 20076e0: 80 a0 80 01 cmp %g2, %g1 20076e4: 32 80 00 06 bne,a 20076fc <_Rate_monotonic_Timeout+0x64> 20076e8: 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 ); 20076ec: 13 04 00 ff sethi %hi(0x1003fc00), %o1 20076f0: 40 00 0a af call 200a1ac <_Thread_Clear_state> 20076f4: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 20076f8: 30 80 00 06 b,a 2007710 <_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 ) { 20076fc: 80 a0 60 01 cmp %g1, 1 2007700: 12 80 00 0d bne 2007734 <_Rate_monotonic_Timeout+0x9c> 2007704: 82 10 20 04 mov 4, %g1 the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING; 2007708: 82 10 20 03 mov 3, %g1 200770c: c2 27 60 38 st %g1, [ %i5 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 2007710: 7f ff fe 70 call 20070d0 <_Rate_monotonic_Initiate_statistics> 2007714: 90 10 00 1d mov %i5, %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007718: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200771c: 11 00 80 7a sethi %hi(0x201e800), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007720: c2 27 60 1c st %g1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007724: 90 12 21 2c or %o0, 0x12c, %o0 2007728: 40 00 0f 57 call 200b484 <_Watchdog_Insert> 200772c: 92 07 60 10 add %i5, 0x10, %o1 2007730: 30 80 00 02 b,a 2007738 <_Rate_monotonic_Timeout+0xa0> _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else the_period->state = RATE_MONOTONIC_EXPIRED; 2007734: 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--; 2007738: 03 00 80 7a sethi %hi(0x201e800), %g1 200773c: c4 00 60 70 ld [ %g1 + 0x70 ], %g2 ! 201e870 <_Thread_Dispatch_disable_level> 2007740: 84 00 bf ff add %g2, -1, %g2 2007744: c4 20 60 70 st %g2, [ %g1 + 0x70 ] return _Thread_Dispatch_disable_level; 2007748: c2 00 60 70 ld [ %g1 + 0x70 ], %g1 200774c: 81 c7 e0 08 ret 2007750: 81 e8 00 00 restore =============================================================================== 02008580 <_Scheduler_priority_Tick>: #include #include void _Scheduler_priority_Tick( void ) { 2008580: 9d e3 bf a0 save %sp, -96, %sp Thread_Control *executing; executing = _Thread_Executing; 2008584: 03 00 80 73 sethi %hi(0x201cc00), %g1 2008588: fa 00 63 04 ld [ %g1 + 0x304 ], %i5 ! 201cf04 <_Per_CPU_Information+0xc> /* * If the thread is not preemptible or is not ready, then * just return. */ if ( !executing->is_preemptible ) 200858c: c2 0f 60 74 ldub [ %i5 + 0x74 ], %g1 2008590: 80 a0 60 00 cmp %g1, 0 2008594: 02 80 00 25 be 2008628 <_Scheduler_priority_Tick+0xa8> 2008598: 01 00 00 00 nop return; if ( !_States_Is_ready( executing->current_state ) ) 200859c: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 20085a0: 80 a0 60 00 cmp %g1, 0 20085a4: 12 80 00 21 bne 2008628 <_Scheduler_priority_Tick+0xa8> 20085a8: 01 00 00 00 nop /* * The cpu budget algorithm determines what happens next. */ switch ( executing->budget_algorithm ) { 20085ac: c2 07 60 7c ld [ %i5 + 0x7c ], %g1 20085b0: 80 a0 60 01 cmp %g1, 1 20085b4: 0a 80 00 14 bcs 2008604 <_Scheduler_priority_Tick+0x84> 20085b8: 80 a0 60 02 cmp %g1, 2 20085bc: 28 80 00 07 bleu,a 20085d8 <_Scheduler_priority_Tick+0x58> 20085c0: c2 07 60 78 ld [ %i5 + 0x78 ], %g1 20085c4: 80 a0 60 03 cmp %g1, 3 20085c8: 12 80 00 18 bne 2008628 <_Scheduler_priority_Tick+0xa8> <== NEVER TAKEN 20085cc: 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 ) 20085d0: 10 80 00 0f b 200860c <_Scheduler_priority_Tick+0x8c> 20085d4: 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 ) { 20085d8: 82 00 7f ff add %g1, -1, %g1 20085dc: 80 a0 60 00 cmp %g1, 0 20085e0: 14 80 00 09 bg 2008604 <_Scheduler_priority_Tick+0x84> 20085e4: 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(); 20085e8: 03 00 80 6f sethi %hi(0x201bc00), %g1 20085ec: c2 00 61 50 ld [ %g1 + 0x150 ], %g1 ! 201bd50 <_Scheduler+0xc> 20085f0: 9f c0 40 00 call %g1 20085f4: 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; 20085f8: 03 00 80 72 sethi %hi(0x201c800), %g1 20085fc: c2 00 61 24 ld [ %g1 + 0x124 ], %g1 ! 201c924 <_Thread_Ticks_per_timeslice> 2008600: c2 27 60 78 st %g1, [ %i5 + 0x78 ] 2008604: 81 c7 e0 08 ret 2008608: 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 ) 200860c: 82 00 7f ff add %g1, -1, %g1 2008610: 80 a0 60 00 cmp %g1, 0 2008614: 12 bf ff fc bne 2008604 <_Scheduler_priority_Tick+0x84> 2008618: c2 27 60 78 st %g1, [ %i5 + 0x78 ] (*executing->budget_callout)( executing ); 200861c: c2 07 60 80 ld [ %i5 + 0x80 ], %g1 2008620: 9f c0 40 00 call %g1 2008624: 90 10 00 1d mov %i5, %o0 2008628: 81 c7 e0 08 ret 200862c: 81 e8 00 00 restore =============================================================================== 02007124 <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 2007124: 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(); 2007128: 03 00 80 78 sethi %hi(0x201e000), %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; 200712c: 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) || 2007130: 80 a6 20 00 cmp %i0, 0 2007134: 02 80 00 2b be 20071e0 <_TOD_Validate+0xbc> <== NEVER TAKEN 2007138: d2 00 63 d8 ld [ %g1 + 0x3d8 ], %o1 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 200713c: 11 00 03 d0 sethi %hi(0xf4000), %o0 2007140: 40 00 49 d5 call 2019894 <.udiv> 2007144: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 2007148: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200714c: 80 a0 40 08 cmp %g1, %o0 2007150: 3a 80 00 25 bcc,a 20071e4 <_TOD_Validate+0xc0> 2007154: b0 0f 60 01 and %i5, 1, %i0 (the_tod->ticks >= ticks_per_second) || 2007158: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200715c: 80 a0 60 3b cmp %g1, 0x3b 2007160: 38 80 00 21 bgu,a 20071e4 <_TOD_Validate+0xc0> 2007164: b0 0f 60 01 and %i5, 1, %i0 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 2007168: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 200716c: 80 a0 60 3b cmp %g1, 0x3b 2007170: 38 80 00 1d bgu,a 20071e4 <_TOD_Validate+0xc0> 2007174: b0 0f 60 01 and %i5, 1, %i0 (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 2007178: c2 06 20 0c ld [ %i0 + 0xc ], %g1 200717c: 80 a0 60 17 cmp %g1, 0x17 2007180: 38 80 00 19 bgu,a 20071e4 <_TOD_Validate+0xc0> 2007184: b0 0f 60 01 and %i5, 1, %i0 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 2007188: 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) || 200718c: 80 a0 60 00 cmp %g1, 0 2007190: 02 80 00 14 be 20071e0 <_TOD_Validate+0xbc> <== NEVER TAKEN 2007194: 80 a0 60 0c cmp %g1, 0xc (the_tod->month == 0) || 2007198: 38 80 00 13 bgu,a 20071e4 <_TOD_Validate+0xc0> 200719c: b0 0f 60 01 and %i5, 1, %i0 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 20071a0: 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) || 20071a4: 80 a0 e7 c3 cmp %g3, 0x7c3 20071a8: 28 80 00 0f bleu,a 20071e4 <_TOD_Validate+0xc0> 20071ac: b0 0f 60 01 and %i5, 1, %i0 (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 20071b0: 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) || 20071b4: 80 a0 a0 00 cmp %g2, 0 20071b8: 02 80 00 0a be 20071e0 <_TOD_Validate+0xbc> <== NEVER TAKEN 20071bc: 80 88 e0 03 btst 3, %g3 20071c0: 07 00 80 73 sethi %hi(0x201cc00), %g3 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 20071c4: 12 80 00 03 bne 20071d0 <_TOD_Validate+0xac> 20071c8: 86 10 e3 28 or %g3, 0x328, %g3 ! 201cf28 <_TOD_Days_per_month> days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 20071cc: 82 00 60 0d add %g1, 0xd, %g1 else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; 20071d0: 83 28 60 02 sll %g1, 2, %g1 20071d4: 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( 20071d8: 80 a0 40 02 cmp %g1, %g2 20071dc: ba 60 3f ff subx %g0, -1, %i5 if ( the_tod->day > days_in_month ) return false; return true; } 20071e0: b0 0f 60 01 and %i5, 1, %i0 20071e4: 81 c7 e0 08 ret 20071e8: 81 e8 00 00 restore =============================================================================== 02008840 <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 2008840: 9d e3 bf a0 save %sp, -96, %sp States_Control state, original_state; /* * Save original state */ original_state = the_thread->current_state; 2008844: 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 ); 2008848: 40 00 03 62 call 20095d0 <_Thread_Set_transient> 200884c: 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 ) 2008850: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2008854: 80 a0 40 19 cmp %g1, %i1 2008858: 02 80 00 05 be 200886c <_Thread_Change_priority+0x2c> 200885c: ba 10 00 18 mov %i0, %i5 _Thread_Set_priority( the_thread, new_priority ); 2008860: 90 10 00 18 mov %i0, %o0 2008864: 40 00 03 42 call 200956c <_Thread_Set_priority> 2008868: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 200886c: 7f ff e6 44 call 200217c 2008870: 01 00 00 00 nop 2008874: 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; 2008878: f2 07 60 10 ld [ %i5 + 0x10 ], %i1 if ( state != STATES_TRANSIENT ) { 200887c: 80 a6 60 04 cmp %i1, 4 2008880: 02 80 00 10 be 20088c0 <_Thread_Change_priority+0x80> 2008884: 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 ) ) 2008888: 80 a7 20 00 cmp %i4, 0 200888c: 12 80 00 03 bne 2008898 <_Thread_Change_priority+0x58> <== NEVER TAKEN 2008890: 82 0e 7f fb and %i1, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); 2008894: c2 27 60 10 st %g1, [ %i5 + 0x10 ] _ISR_Enable( level ); 2008898: 7f ff e6 3d call 200218c 200889c: 90 10 00 1b mov %i3, %o0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 20088a0: 03 00 00 ef sethi %hi(0x3bc00), %g1 20088a4: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 20088a8: 80 8e 40 01 btst %i1, %g1 20088ac: 02 80 00 29 be 2008950 <_Thread_Change_priority+0x110> 20088b0: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 20088b4: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 20088b8: 40 00 02 ff call 20094b4 <_Thread_queue_Requeue> 20088bc: 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 ) ) { 20088c0: 80 a7 20 00 cmp %i4, 0 20088c4: 12 80 00 0b bne 20088f0 <_Thread_Change_priority+0xb0> <== NEVER TAKEN 20088c8: 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 ); 20088cc: c0 27 60 10 clr [ %i5 + 0x10 ] if ( prepend_it ) 20088d0: 80 a6 a0 00 cmp %i2, 0 20088d4: 02 80 00 04 be 20088e4 <_Thread_Change_priority+0xa4> 20088d8: 82 10 61 44 or %g1, 0x144, %g1 */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue_first( the_thread ); 20088dc: 10 80 00 03 b 20088e8 <_Thread_Change_priority+0xa8> 20088e0: c2 00 60 28 ld [ %g1 + 0x28 ], %g1 */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue( the_thread ); 20088e4: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 20088e8: 9f c0 40 00 call %g1 20088ec: 90 10 00 1d mov %i5, %o0 _Scheduler_Enqueue_first( the_thread ); else _Scheduler_Enqueue( the_thread ); } _ISR_Flash( level ); 20088f0: 7f ff e6 27 call 200218c 20088f4: 90 10 00 1b mov %i3, %o0 20088f8: 7f ff e6 21 call 200217c 20088fc: 01 00 00 00 nop 2008900: 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(); 2008904: 03 00 80 6f sethi %hi(0x201bc00), %g1 2008908: c2 00 61 4c ld [ %g1 + 0x14c ], %g1 ! 201bd4c <_Scheduler+0x8> 200890c: 9f c0 40 00 call %g1 2008910: 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 ); 2008914: 03 00 80 73 sethi %hi(0x201cc00), %g1 2008918: 82 10 62 f8 or %g1, 0x2f8, %g1 ! 201cef8 <_Per_CPU_Information> 200891c: 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() && 2008920: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 2008924: 80 a0 80 03 cmp %g2, %g3 2008928: 02 80 00 08 be 2008948 <_Thread_Change_priority+0x108> 200892c: 01 00 00 00 nop 2008930: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 2008934: 80 a0 a0 00 cmp %g2, 0 2008938: 02 80 00 04 be 2008948 <_Thread_Change_priority+0x108> 200893c: 01 00 00 00 nop _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 2008940: 84 10 20 01 mov 1, %g2 ! 1 2008944: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] _ISR_Enable( level ); 2008948: 7f ff e6 11 call 200218c 200894c: 81 e8 00 00 restore 2008950: 81 c7 e0 08 ret 2008954: 81 e8 00 00 restore =============================================================================== 02008b44 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 2008b44: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2008b48: 90 10 00 18 mov %i0, %o0 2008b4c: 40 00 00 6e call 2008d04 <_Thread_Get> 2008b50: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2008b54: c2 07 bf fc ld [ %fp + -4 ], %g1 2008b58: 80 a0 60 00 cmp %g1, 0 2008b5c: 12 80 00 09 bne 2008b80 <_Thread_Delay_ended+0x3c> <== NEVER TAKEN 2008b60: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 2008b64: 7f ff ff 7d call 2008958 <_Thread_Clear_state> 2008b68: 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--; 2008b6c: 03 00 80 72 sethi %hi(0x201c800), %g1 2008b70: c4 00 61 c0 ld [ %g1 + 0x1c0 ], %g2 ! 201c9c0 <_Thread_Dispatch_disable_level> 2008b74: 84 00 bf ff add %g2, -1, %g2 2008b78: c4 20 61 c0 st %g2, [ %g1 + 0x1c0 ] return _Thread_Dispatch_disable_level; 2008b7c: c2 00 61 c0 ld [ %g1 + 0x1c0 ], %g1 2008b80: 81 c7 e0 08 ret 2008b84: 81 e8 00 00 restore =============================================================================== 02008b88 <_Thread_Dispatch>: * INTERRUPT LATENCY: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 2008b88: 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++; 2008b8c: 03 00 80 72 sethi %hi(0x201c800), %g1 2008b90: c4 00 61 c0 ld [ %g1 + 0x1c0 ], %g2 ! 201c9c0 <_Thread_Dispatch_disable_level> 2008b94: 84 00 a0 01 inc %g2 2008b98: c4 20 61 c0 st %g2, [ %g1 + 0x1c0 ] return _Thread_Dispatch_disable_level; 2008b9c: c2 00 61 c0 ld [ %g1 + 0x1c0 ], %g1 #endif /* * Now determine if we need to perform a dispatch on the current CPU. */ executing = _Thread_Executing; 2008ba0: 33 00 80 73 sethi %hi(0x201cc00), %i1 2008ba4: b4 16 62 f8 or %i1, 0x2f8, %i2 ! 201cef8 <_Per_CPU_Information> _ISR_Disable( level ); 2008ba8: 7f ff e5 75 call 200217c 2008bac: 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; 2008bb0: 21 00 80 72 sethi %hi(0x201c800), %l0 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 2008bb4: b4 06 a0 1c add %i2, 0x1c, %i2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 2008bb8: 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 ) { 2008bbc: 10 80 00 38 b 2008c9c <_Thread_Dispatch+0x114> 2008bc0: 37 00 80 72 sethi %hi(0x201c800), %i3 heir = _Thread_Heir; _Thread_Dispatch_necessary = false; 2008bc4: 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 ) 2008bc8: 80 a7 00 1d cmp %i4, %i5 2008bcc: 02 80 00 39 be 2008cb0 <_Thread_Dispatch+0x128> 2008bd0: 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 ) 2008bd4: c2 07 20 7c ld [ %i4 + 0x7c ], %g1 2008bd8: 80 a0 60 01 cmp %g1, 1 2008bdc: 12 80 00 03 bne 2008be8 <_Thread_Dispatch+0x60> 2008be0: c2 04 21 24 ld [ %l0 + 0x124 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 2008be4: c2 27 20 78 st %g1, [ %i4 + 0x78 ] _ISR_Enable( level ); 2008be8: 7f ff e5 69 call 200218c 2008bec: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 2008bf0: 40 00 0e c8 call 200c710 <_TOD_Get_uptime> 2008bf4: 90 07 bf f0 add %fp, -16, %o0 _Timestamp_Subtract( 2008bf8: 90 10 00 1a mov %i2, %o0 2008bfc: 92 07 bf f0 add %fp, -16, %o1 2008c00: 40 00 02 ed call 20097b4 <_Timespec_Subtract> 2008c04: 94 07 bf f8 add %fp, -8, %o2 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); 2008c08: 90 07 60 84 add %i5, 0x84, %o0 2008c0c: 40 00 02 d1 call 2009750 <_Timespec_Add_to> 2008c10: 92 07 bf f8 add %fp, -8, %o1 _Thread_Time_of_last_context_switch = uptime; 2008c14: c4 07 bf f0 ld [ %fp + -16 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 2008c18: c2 06 22 48 ld [ %i0 + 0x248 ], %g1 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); _Thread_Time_of_last_context_switch = uptime; 2008c1c: c4 26 80 00 st %g2, [ %i2 ] 2008c20: c4 07 bf f4 ld [ %fp + -12 ], %g2 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 2008c24: 80 a0 60 00 cmp %g1, 0 2008c28: 02 80 00 06 be 2008c40 <_Thread_Dispatch+0xb8> <== NEVER TAKEN 2008c2c: c4 26 a0 04 st %g2, [ %i2 + 4 ] executing->libc_reent = *_Thread_libc_reent; 2008c30: c4 00 40 00 ld [ %g1 ], %g2 2008c34: c4 27 61 54 st %g2, [ %i5 + 0x154 ] *_Thread_libc_reent = heir->libc_reent; 2008c38: c4 07 21 54 ld [ %i4 + 0x154 ], %g2 2008c3c: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 2008c40: 90 10 00 1d mov %i5, %o0 2008c44: 40 00 03 8a call 2009a6c <_User_extensions_Thread_switch> 2008c48: 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 ); 2008c4c: 90 07 60 c8 add %i5, 0xc8, %o0 2008c50: 40 00 04 b0 call 2009f10 <_CPU_Context_switch> 2008c54: 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) && 2008c58: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 2008c5c: 80 a0 60 00 cmp %g1, 0 2008c60: 02 80 00 0c be 2008c90 <_Thread_Dispatch+0x108> 2008c64: d0 06 e2 44 ld [ %i3 + 0x244 ], %o0 2008c68: 80 a7 40 08 cmp %i5, %o0 2008c6c: 02 80 00 09 be 2008c90 <_Thread_Dispatch+0x108> 2008c70: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 2008c74: 02 80 00 04 be 2008c84 <_Thread_Dispatch+0xfc> 2008c78: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 2008c7c: 40 00 04 6b call 2009e28 <_CPU_Context_save_fp> 2008c80: 90 02 21 50 add %o0, 0x150, %o0 _Context_Restore_fp( &executing->fp_context ); 2008c84: 40 00 04 86 call 2009e9c <_CPU_Context_restore_fp> 2008c88: 90 07 61 50 add %i5, 0x150, %o0 _Thread_Allocated_fp = executing; 2008c8c: fa 26 e2 44 st %i5, [ %i3 + 0x244 ] if ( executing->fp_context != NULL ) _Context_Restore_fp( &executing->fp_context ); #endif #endif executing = _Thread_Executing; 2008c90: 82 16 62 f8 or %i1, 0x2f8, %g1 _ISR_Disable( level ); 2008c94: 7f ff e5 3a call 200217c 2008c98: 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 ) { 2008c9c: 82 16 62 f8 or %i1, 0x2f8, %g1 2008ca0: c4 08 60 18 ldub [ %g1 + 0x18 ], %g2 2008ca4: 80 a0 a0 00 cmp %g2, 0 2008ca8: 32 bf ff c7 bne,a 2008bc4 <_Thread_Dispatch+0x3c> 2008cac: 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; 2008cb0: 03 00 80 72 sethi %hi(0x201c800), %g1 2008cb4: c0 20 61 c0 clr [ %g1 + 0x1c0 ] ! 201c9c0 <_Thread_Dispatch_disable_level> } post_switch: _Thread_Dispatch_set_disable_level( 0 ); _ISR_Enable( level ); 2008cb8: 7f ff e5 35 call 200218c 2008cbc: 01 00 00 00 nop _API_extensions_Run_postswitch(); 2008cc0: 7f ff f8 3e call 2006db8 <_API_extensions_Run_postswitch> 2008cc4: 01 00 00 00 nop } 2008cc8: 81 c7 e0 08 ret 2008ccc: 81 e8 00 00 restore =============================================================================== 0200e7b8 <_Thread_Handler>: * * Output parameters: NONE */ void _Thread_Handler( void ) { 200e7b8: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static char doneConstructors; char doneCons; #endif executing = _Thread_Executing; 200e7bc: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e7c0: fa 00 63 04 ld [ %g1 + 0x304 ], %i5 ! 201cf04 <_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(); 200e7c4: 3f 00 80 39 sethi %hi(0x200e400), %i7 200e7c8: be 17 e3 b8 or %i7, 0x3b8, %i7 ! 200e7b8 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 200e7cc: d0 07 60 ac ld [ %i5 + 0xac ], %o0 _ISR_Set_level(level); 200e7d0: 7f ff ce 6f call 200218c 200e7d4: 91 2a 20 08 sll %o0, 8, %o0 #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200e7d8: 03 00 80 71 sethi %hi(0x201c400), %g1 doneConstructors = 1; 200e7dc: 84 10 20 01 mov 1, %g2 level = executing->Start.isr_level; _ISR_Set_level(level); #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200e7e0: f8 08 62 7c ldub [ %g1 + 0x27c ], %i4 doneConstructors = 1; 200e7e4: c4 28 62 7c stb %g2, [ %g1 + 0x27c ] #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200e7e8: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 200e7ec: 80 a0 60 00 cmp %g1, 0 200e7f0: 02 80 00 0c be 200e820 <_Thread_Handler+0x68> 200e7f4: 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 ); 200e7f8: d0 00 62 44 ld [ %g1 + 0x244 ], %o0 ! 201ca44 <_Thread_Allocated_fp> 200e7fc: 80 a7 40 08 cmp %i5, %o0 200e800: 02 80 00 08 be 200e820 <_Thread_Handler+0x68> 200e804: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200e808: 22 80 00 06 be,a 200e820 <_Thread_Handler+0x68> 200e80c: fa 20 62 44 st %i5, [ %g1 + 0x244 ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200e810: 7f ff ed 86 call 2009e28 <_CPU_Context_save_fp> 200e814: 90 02 21 50 add %o0, 0x150, %o0 _Thread_Allocated_fp = executing; 200e818: 03 00 80 72 sethi %hi(0x201c800), %g1 200e81c: fa 20 62 44 st %i5, [ %g1 + 0x244 ] ! 201ca44 <_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 ); 200e820: 7f ff ec 24 call 20098b0 <_User_extensions_Thread_begin> 200e824: 90 10 00 1d mov %i5, %o0 /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 200e828: 7f ff e9 2a call 2008cd0 <_Thread_Enable_dispatch> 200e82c: 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) */ { 200e830: 80 a7 20 00 cmp %i4, 0 200e834: 32 80 00 05 bne,a 200e848 <_Thread_Handler+0x90> 200e838: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 INIT_NAME (); 200e83c: 40 00 34 f9 call 201bc20 <_init> 200e840: 01 00 00 00 nop #endif } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200e844: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 200e848: 80 a0 60 00 cmp %g1, 0 200e84c: 12 80 00 05 bne 200e860 <_Thread_Handler+0xa8> 200e850: 80 a0 60 01 cmp %g1, 1 executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 200e854: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 200e858: 10 80 00 06 b 200e870 <_Thread_Handler+0xb8> 200e85c: 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 ) { 200e860: 12 80 00 07 bne 200e87c <_Thread_Handler+0xc4> <== NEVER TAKEN 200e864: 01 00 00 00 nop executing->Wait.return_argument = (*(Thread_Entry_pointer) executing->Start.entry_point)( 200e868: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 200e86c: d0 07 60 98 ld [ %i5 + 0x98 ], %o0 200e870: 9f c0 40 00 call %g1 200e874: 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 = 200e878: 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 ); 200e87c: 7f ff ec 1e call 20098f4 <_User_extensions_Thread_exitted> 200e880: 90 10 00 1d mov %i5, %o0 _Internal_error_Occurred( 200e884: 90 10 20 00 clr %o0 200e888: 92 10 20 01 mov 1, %o1 200e88c: 7f ff e3 ee call 2007844 <_Internal_error_Occurred> 200e890: 94 10 20 05 mov 5, %o2 =============================================================================== 02008db4 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 2008db4: 9d e3 bf a0 save %sp, -96, %sp 2008db8: 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; 2008dbc: c0 26 61 58 clr [ %i1 + 0x158 ] 2008dc0: c0 26 61 5c clr [ %i1 + 0x15c ] extensions_area = NULL; the_thread->libc_reent = NULL; 2008dc4: 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 ) { 2008dc8: e0 07 a0 60 ld [ %fp + 0x60 ], %l0 2008dcc: 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 ) { 2008dd0: 80 a6 a0 00 cmp %i2, 0 2008dd4: 12 80 00 0d bne 2008e08 <_Thread_Initialize+0x54> 2008dd8: e4 0f a0 5f ldub [ %fp + 0x5f ], %l2 actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); 2008ddc: 90 10 00 19 mov %i1, %o0 2008de0: 40 00 02 0b call 200960c <_Thread_Stack_Allocate> 2008de4: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 2008de8: 80 a2 00 1b cmp %o0, %i3 2008dec: 0a 80 00 6a bcs 2008f94 <_Thread_Initialize+0x1e0> 2008df0: 80 a2 20 00 cmp %o0, 0 2008df4: 02 80 00 68 be 2008f94 <_Thread_Initialize+0x1e0> <== NEVER TAKEN 2008df8: 82 10 20 01 mov 1, %g1 return false; /* stack allocation failed */ stack = the_thread->Start.stack; 2008dfc: f4 06 60 c4 ld [ %i1 + 0xc4 ], %i2 the_thread->Start.core_allocated_stack = true; 2008e00: 10 80 00 04 b 2008e10 <_Thread_Initialize+0x5c> 2008e04: c2 2e 60 b4 stb %g1, [ %i1 + 0xb4 ] } else { stack = stack_area; actual_stack_size = stack_size; the_thread->Start.core_allocated_stack = false; 2008e08: c0 2e 60 b4 clrb [ %i1 + 0xb4 ] 2008e0c: 90 10 00 1b mov %i3, %o0 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 2008e10: f4 26 60 bc st %i2, [ %i1 + 0xbc ] the_stack->size = size; 2008e14: 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 ) { 2008e18: 80 a7 20 00 cmp %i4, 0 2008e1c: 02 80 00 07 be 2008e38 <_Thread_Initialize+0x84> 2008e20: b6 10 20 00 clr %i3 fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE ); 2008e24: 40 00 03 e5 call 2009db8 <_Workspace_Allocate> 2008e28: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 2008e2c: b6 92 20 00 orcc %o0, 0, %i3 2008e30: 02 80 00 4a be 2008f58 <_Thread_Initialize+0x1a4> 2008e34: b8 10 20 00 clr %i4 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2008e38: 03 00 80 72 sethi %hi(0x201c800), %g1 2008e3c: d0 00 62 54 ld [ %g1 + 0x254 ], %o0 ! 201ca54 <_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; 2008e40: f6 26 61 50 st %i3, [ %i1 + 0x150 ] the_thread->Start.fp_context = fp_area; 2008e44: f6 26 60 c0 st %i3, [ %i1 + 0xc0 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2008e48: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 2008e4c: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 2008e50: c0 26 60 68 clr [ %i1 + 0x68 ] the_watchdog->user_data = user_data; 2008e54: c0 26 60 6c clr [ %i1 + 0x6c ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2008e58: 80 a2 20 00 cmp %o0, 0 2008e5c: 02 80 00 08 be 2008e7c <_Thread_Initialize+0xc8> 2008e60: b8 10 20 00 clr %i4 extensions_area = _Workspace_Allocate( 2008e64: 90 02 20 01 inc %o0 2008e68: 40 00 03 d4 call 2009db8 <_Workspace_Allocate> 2008e6c: 91 2a 20 02 sll %o0, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 2008e70: b8 92 20 00 orcc %o0, 0, %i4 2008e74: 02 80 00 3a be 2008f5c <_Thread_Initialize+0x1a8> 2008e78: 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 ) { 2008e7c: 80 a7 20 00 cmp %i4, 0 2008e80: 02 80 00 0c be 2008eb0 <_Thread_Initialize+0xfc> 2008e84: f8 26 61 60 st %i4, [ %i1 + 0x160 ] for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) 2008e88: 03 00 80 72 sethi %hi(0x201c800), %g1 2008e8c: c4 00 62 54 ld [ %g1 + 0x254 ], %g2 ! 201ca54 <_Thread_Maximum_extensions> 2008e90: 10 80 00 05 b 2008ea4 <_Thread_Initialize+0xf0> 2008e94: 82 10 20 00 clr %g1 the_thread->extensions[i] = NULL; 2008e98: 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++ ) 2008e9c: 82 00 60 01 inc %g1 the_thread->extensions[i] = NULL; 2008ea0: 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++ ) 2008ea4: 80 a0 40 02 cmp %g1, %g2 2008ea8: 28 bf ff fc bleu,a 2008e98 <_Thread_Initialize+0xe4> 2008eac: 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; 2008eb0: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 2008eb4: e4 2e 60 a0 stb %l2, [ %i1 + 0xa0 ] the_thread->Start.budget_algorithm = budget_algorithm; 2008eb8: e0 26 60 a4 st %l0, [ %i1 + 0xa4 ] the_thread->Start.budget_callout = budget_callout; switch ( budget_algorithm ) { 2008ebc: 80 a4 20 02 cmp %l0, 2 2008ec0: 12 80 00 05 bne 2008ed4 <_Thread_Initialize+0x120> 2008ec4: 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; 2008ec8: 03 00 80 72 sethi %hi(0x201c800), %g1 2008ecc: c2 00 61 24 ld [ %g1 + 0x124 ], %g1 ! 201c924 <_Thread_Ticks_per_timeslice> 2008ed0: c2 26 60 78 st %g1, [ %i1 + 0x78 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2008ed4: c2 07 a0 68 ld [ %fp + 0x68 ], %g1 the_thread->current_state = STATES_DORMANT; the_thread->Wait.queue = NULL; 2008ed8: c0 26 60 44 clr [ %i1 + 0x44 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2008edc: c2 26 60 ac st %g1, [ %i1 + 0xac ] the_thread->current_state = STATES_DORMANT; 2008ee0: 82 10 20 01 mov 1, %g1 2008ee4: c2 26 60 10 st %g1, [ %i1 + 0x10 ] */ RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate( Thread_Control *the_thread ) { return _Scheduler.Operations.allocate( the_thread ); 2008ee8: 03 00 80 6f sethi %hi(0x201bc00), %g1 2008eec: c2 00 61 5c ld [ %g1 + 0x15c ], %g1 ! 201bd5c <_Scheduler+0x18> the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 2008ef0: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 2008ef4: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 2008ef8: fa 26 60 b0 st %i5, [ %i1 + 0xb0 ] 2008efc: 9f c0 40 00 call %g1 2008f00: 90 10 00 19 mov %i1, %o0 sched =_Scheduler_Allocate( the_thread ); if ( !sched ) 2008f04: b4 92 20 00 orcc %o0, 0, %i2 2008f08: 02 80 00 15 be 2008f5c <_Thread_Initialize+0x1a8> 2008f0c: 90 10 00 19 mov %i1, %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 2008f10: 40 00 01 97 call 200956c <_Thread_Set_priority> 2008f14: 92 10 00 1d mov %i5, %o1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008f18: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2008f1c: 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 ); 2008f20: c0 26 60 84 clr [ %i1 + 0x84 ] 2008f24: c0 26 60 88 clr [ %i1 + 0x88 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008f28: 83 28 60 02 sll %g1, 2, %g1 2008f2c: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2008f30: 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 ); 2008f34: 90 10 00 19 mov %i1, %o0 2008f38: 40 00 02 90 call 2009978 <_User_extensions_Thread_create> 2008f3c: b0 10 20 01 mov 1, %i0 if ( extension_status ) 2008f40: 80 8a 20 ff btst 0xff, %o0 2008f44: 02 80 00 06 be 2008f5c <_Thread_Initialize+0x1a8> 2008f48: 01 00 00 00 nop 2008f4c: b0 0e 20 01 and %i0, 1, %i0 2008f50: 81 c7 e0 08 ret 2008f54: 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; 2008f58: 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 ); 2008f5c: 40 00 03 9f call 2009dd8 <_Workspace_Free> 2008f60: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 2008f64: 40 00 03 9d call 2009dd8 <_Workspace_Free> 2008f68: d0 06 61 58 ld [ %i1 + 0x158 ], %o0 2008f6c: 40 00 03 9b call 2009dd8 <_Workspace_Free> 2008f70: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 _Workspace_Free( extensions_area ); 2008f74: 40 00 03 99 call 2009dd8 <_Workspace_Free> 2008f78: 90 10 00 1c mov %i4, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); 2008f7c: 40 00 03 97 call 2009dd8 <_Workspace_Free> 2008f80: 90 10 00 1b mov %i3, %o0 #endif _Workspace_Free( sched ); 2008f84: 40 00 03 95 call 2009dd8 <_Workspace_Free> 2008f88: 90 10 00 1a mov %i2, %o0 _Thread_Stack_Free( the_thread ); 2008f8c: 40 00 01 b7 call 2009668 <_Thread_Stack_Free> 2008f90: 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 */ 2008f94: b0 10 20 00 clr %i0 _Workspace_Free( sched ); _Thread_Stack_Free( the_thread ); return false; } 2008f98: b0 0e 20 01 and %i0, 1, %i0 2008f9c: 81 c7 e0 08 ret 2008fa0: 81 e8 00 00 restore =============================================================================== 020094b4 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 20094b4: 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 ) 20094b8: 80 a6 20 00 cmp %i0, 0 20094bc: 02 80 00 19 be 2009520 <_Thread_queue_Requeue+0x6c> <== NEVER TAKEN 20094c0: 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 ) { 20094c4: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 20094c8: 80 a7 20 01 cmp %i4, 1 20094cc: 12 80 00 15 bne 2009520 <_Thread_queue_Requeue+0x6c> <== NEVER TAKEN 20094d0: 01 00 00 00 nop Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 20094d4: 7f ff e3 2a call 200217c 20094d8: 01 00 00 00 nop 20094dc: ba 10 00 08 mov %o0, %i5 20094e0: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 20094e4: 03 00 00 ef sethi %hi(0x3bc00), %g1 20094e8: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 20094ec: 80 88 80 01 btst %g2, %g1 20094f0: 02 80 00 0a be 2009518 <_Thread_queue_Requeue+0x64> <== NEVER TAKEN 20094f4: 90 10 00 18 mov %i0, %o0 _Thread_queue_Enter_critical_section( tq ); _Thread_queue_Extract_priority_helper( tq, the_thread, true ); 20094f8: 92 10 00 19 mov %i1, %o1 20094fc: 94 10 20 01 mov 1, %o2 2009500: 40 00 0d f3 call 200cccc <_Thread_queue_Extract_priority_helper> 2009504: f8 26 20 30 st %i4, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 2009508: 90 10 00 18 mov %i0, %o0 200950c: 92 10 00 19 mov %i1, %o1 2009510: 7f ff ff 50 call 2009250 <_Thread_queue_Enqueue_priority> 2009514: 94 07 bf fc add %fp, -4, %o2 } _ISR_Enable( level ); 2009518: 7f ff e3 1d call 200218c 200951c: 90 10 00 1d mov %i5, %o0 2009520: 81 c7 e0 08 ret 2009524: 81 e8 00 00 restore =============================================================================== 02009528 <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 2009528: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 200952c: 90 10 00 18 mov %i0, %o0 2009530: 7f ff fd f5 call 2008d04 <_Thread_Get> 2009534: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2009538: c2 07 bf fc ld [ %fp + -4 ], %g1 200953c: 80 a0 60 00 cmp %g1, 0 2009540: 12 80 00 09 bne 2009564 <_Thread_queue_Timeout+0x3c> <== NEVER TAKEN 2009544: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 2009548: 40 00 0e 18 call 200cda8 <_Thread_queue_Process_timeout> 200954c: 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--; 2009550: 03 00 80 72 sethi %hi(0x201c800), %g1 2009554: c4 00 61 c0 ld [ %g1 + 0x1c0 ], %g2 ! 201c9c0 <_Thread_Dispatch_disable_level> 2009558: 84 00 bf ff add %g2, -1, %g2 200955c: c4 20 61 c0 st %g2, [ %g1 + 0x1c0 ] return _Thread_Dispatch_disable_level; 2009560: c2 00 61 c0 ld [ %g1 + 0x1c0 ], %g1 2009564: 81 c7 e0 08 ret 2009568: 81 e8 00 00 restore =============================================================================== 0201715c <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 201715c: 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; 2017160: 27 00 80 ed sethi %hi(0x203b400), %l3 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2017164: a8 07 bf e8 add %fp, -24, %l4 2017168: a4 07 bf ec add %fp, -20, %l2 201716c: b6 07 bf f4 add %fp, -12, %i3 2017170: b4 07 bf f8 add %fp, -8, %i2 2017174: e4 27 bf e8 st %l2, [ %fp + -24 ] head->previous = NULL; 2017178: c0 27 bf ec clr [ %fp + -20 ] tail->previous = head; 201717c: 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; 2017180: f4 27 bf f4 st %i2, [ %fp + -12 ] head->previous = NULL; 2017184: c0 27 bf f8 clr [ %fp + -8 ] tail->previous = head; 2017188: 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 ); 201718c: 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 ); 2017190: 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 ); 2017194: 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 ); 2017198: 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; 201719c: 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(); 20171a0: 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; 20171a4: c2 04 e3 3c ld [ %l3 + 0x33c ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 20171a8: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20171ac: 94 10 00 1b mov %i3, %o2 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 20171b0: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 20171b4: 90 10 00 19 mov %i1, %o0 20171b8: 40 00 11 ed call 201b96c <_Watchdog_Adjust_to_chain> 20171bc: 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; 20171c0: 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(); 20171c4: fa 05 62 bc ld [ %l5 + 0x2bc ], %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 ) { 20171c8: 80 a7 40 0a cmp %i5, %o2 20171cc: 08 80 00 06 bleu 20171e4 <_Timer_server_Body+0x88> 20171d0: 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 ); 20171d4: 90 10 00 1c mov %i4, %o0 20171d8: 40 00 11 e5 call 201b96c <_Watchdog_Adjust_to_chain> 20171dc: 94 10 00 1b mov %i3, %o2 20171e0: 30 80 00 06 b,a 20171f8 <_Timer_server_Body+0x9c> } else if ( snapshot < last_snapshot ) { 20171e4: 1a 80 00 05 bcc 20171f8 <_Timer_server_Body+0x9c> 20171e8: 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 ); 20171ec: 92 10 20 01 mov 1, %o1 20171f0: 40 00 11 b8 call 201b8d0 <_Watchdog_Adjust> 20171f4: 94 22 80 1d sub %o2, %i5, %o2 } watchdogs->last_snapshot = snapshot; 20171f8: 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 ); 20171fc: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2017200: 40 00 02 d9 call 2017d64 <_Chain_Get> 2017204: 01 00 00 00 nop if ( timer == NULL ) { 2017208: 92 92 20 00 orcc %o0, 0, %o1 201720c: 02 80 00 0c be 201723c <_Timer_server_Body+0xe0> 2017210: 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 ) { 2017214: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 2017218: 80 a0 60 01 cmp %g1, 1 201721c: 02 80 00 05 be 2017230 <_Timer_server_Body+0xd4> 2017220: 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 ) { 2017224: 80 a0 60 03 cmp %g1, 3 2017228: 12 bf ff f5 bne 20171fc <_Timer_server_Body+0xa0> <== NEVER TAKEN 201722c: 90 10 00 1c mov %i4, %o0 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2017230: 40 00 12 01 call 201ba34 <_Watchdog_Insert> 2017234: 92 02 60 10 add %o1, 0x10, %o1 2017238: 30 bf ff f1 b,a 20171fc <_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 ); 201723c: 7f ff e3 a1 call 20100c0 2017240: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 2017244: c2 07 bf e8 ld [ %fp + -24 ], %g1 2017248: 80 a0 40 12 cmp %g1, %l2 201724c: 12 80 00 0a bne 2017274 <_Timer_server_Body+0x118> <== NEVER TAKEN 2017250: 01 00 00 00 nop ts->insert_chain = NULL; 2017254: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 2017258: 7f ff e3 9e call 20100d0 201725c: 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 ) ) { 2017260: c2 07 bf f4 ld [ %fp + -12 ], %g1 2017264: 80 a0 40 1a cmp %g1, %i2 2017268: 12 80 00 06 bne 2017280 <_Timer_server_Body+0x124> 201726c: 01 00 00 00 nop 2017270: 30 80 00 18 b,a 20172d0 <_Timer_server_Body+0x174> ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 2017274: 7f ff e3 97 call 20100d0 <== NOT EXECUTED 2017278: 01 00 00 00 nop <== NOT EXECUTED 201727c: 30 bf ff ca b,a 20171a4 <_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 ); 2017280: 7f ff e3 90 call 20100c0 2017284: 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; 2017288: 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)) 201728c: 80 a7 40 1a cmp %i5, %i2 2017290: 02 80 00 0d be 20172c4 <_Timer_server_Body+0x168> 2017294: 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; 2017298: c2 07 40 00 ld [ %i5 ], %g1 head->next = new_first; new_first->previous = head; 201729c: 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; 20172a0: c2 27 bf f4 st %g1, [ %fp + -12 ] watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; 20172a4: c0 27 60 08 clr [ %i5 + 8 ] _ISR_Enable( level ); 20172a8: 7f ff e3 8a call 20100d0 20172ac: 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 ); 20172b0: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 20172b4: d0 07 60 20 ld [ %i5 + 0x20 ], %o0 20172b8: 9f c0 40 00 call %g1 20172bc: d2 07 60 24 ld [ %i5 + 0x24 ], %o1 } 20172c0: 30 bf ff f0 b,a 2017280 <_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 ); 20172c4: 7f ff e3 83 call 20100d0 20172c8: 01 00 00 00 nop 20172cc: 30 bf ff b4 b,a 201719c <_Timer_server_Body+0x40> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 20172d0: c0 2e 20 7c clrb [ %i0 + 0x7c ] /* * Block until there is something to do. */ _Thread_Disable_dispatch(); 20172d4: 7f ff ff 73 call 20170a0 <_Thread_Disable_dispatch> 20172d8: 01 00 00 00 nop _Thread_Set_state( ts->thread, STATES_DELAYING ); 20172dc: d0 06 00 00 ld [ %i0 ], %o0 20172e0: 40 00 10 02 call 201b2e8 <_Thread_Set_state> 20172e4: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 20172e8: 7f ff ff 75 call 20170bc <_Timer_server_Reset_interval_system_watchdog> 20172ec: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 20172f0: 7f ff ff 87 call 201710c <_Timer_server_Reset_tod_system_watchdog> 20172f4: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 20172f8: 40 00 0d aa call 201a9a0 <_Thread_Enable_dispatch> 20172fc: 01 00 00 00 nop ts->active = true; 2017300: 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 ); 2017304: 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; 2017308: 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 ); 201730c: 40 00 12 24 call 201bb9c <_Watchdog_Remove> 2017310: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 2017314: 40 00 12 22 call 201bb9c <_Watchdog_Remove> 2017318: 90 10 00 10 mov %l0, %o0 201731c: 30 bf ff a0 b,a 201719c <_Timer_server_Body+0x40> =============================================================================== 02017320 <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 2017320: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 2017324: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 2017328: 80 a0 60 00 cmp %g1, 0 201732c: 12 80 00 49 bne 2017450 <_Timer_server_Schedule_operation_method+0x130> 2017330: 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(); 2017334: 7f ff ff 5b call 20170a0 <_Thread_Disable_dispatch> 2017338: 01 00 00 00 nop if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 201733c: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 2017340: 80 a0 60 01 cmp %g1, 1 2017344: 12 80 00 1f bne 20173c0 <_Timer_server_Schedule_operation_method+0xa0> 2017348: 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 ); 201734c: 7f ff e3 5d call 20100c0 2017350: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 2017354: 03 00 80 ed sethi %hi(0x203b400), %g1 2017358: c4 00 63 3c ld [ %g1 + 0x33c ], %g2 ! 203b73c <_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; 201735c: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 last_snapshot = ts->Interval_watchdogs.last_snapshot; 2017360: 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 ); 2017364: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 2017368: 80 a0 40 03 cmp %g1, %g3 201736c: 02 80 00 08 be 201738c <_Timer_server_Schedule_operation_method+0x6c> 2017370: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 2017374: de 00 60 10 ld [ %g1 + 0x10 ], %o7 if (delta_interval > delta) { 2017378: 80 a3 c0 04 cmp %o7, %g4 201737c: 08 80 00 03 bleu 2017388 <_Timer_server_Schedule_operation_method+0x68> 2017380: 86 10 20 00 clr %g3 delta_interval -= delta; 2017384: 86 23 c0 04 sub %o7, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 2017388: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 201738c: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 2017390: 7f ff e3 50 call 20100d0 2017394: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 2017398: 90 06 20 30 add %i0, 0x30, %o0 201739c: 40 00 11 a6 call 201ba34 <_Watchdog_Insert> 20173a0: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 20173a4: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 20173a8: 80 a0 60 00 cmp %g1, 0 20173ac: 12 80 00 27 bne 2017448 <_Timer_server_Schedule_operation_method+0x128> 20173b0: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 20173b4: 7f ff ff 42 call 20170bc <_Timer_server_Reset_interval_system_watchdog> 20173b8: 90 10 00 18 mov %i0, %o0 20173bc: 30 80 00 23 b,a 2017448 <_Timer_server_Schedule_operation_method+0x128> } } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 20173c0: 12 80 00 22 bne 2017448 <_Timer_server_Schedule_operation_method+0x128> 20173c4: 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 ); 20173c8: 7f ff e3 3e call 20100c0 20173cc: 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; 20173d0: c4 06 20 68 ld [ %i0 + 0x68 ], %g2 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; 20173d4: 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(); 20173d8: 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 ); 20173dc: 86 06 20 6c add %i0, 0x6c, %g3 last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 20173e0: 80 a0 80 03 cmp %g2, %g3 20173e4: 02 80 00 0d be 2017418 <_Timer_server_Schedule_operation_method+0xf8> 20173e8: c2 00 62 bc ld [ %g1 + 0x2bc ], %g1 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; 20173ec: c8 00 a0 10 ld [ %g2 + 0x10 ], %g4 if ( snapshot > last_snapshot ) { 20173f0: 80 a0 40 0f cmp %g1, %o7 } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 20173f4: 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 ) { 20173f8: 08 80 00 07 bleu 2017414 <_Timer_server_Schedule_operation_method+0xf4> 20173fc: 86 20 c0 01 sub %g3, %g1, %g3 /* * We advanced in time. */ delta = snapshot - last_snapshot; 2017400: 9e 20 40 0f sub %g1, %o7, %o7 if (delta_interval > delta) { 2017404: 80 a1 00 0f cmp %g4, %o7 2017408: 08 80 00 03 bleu 2017414 <_Timer_server_Schedule_operation_method+0xf4><== NEVER TAKEN 201740c: 86 10 20 00 clr %g3 delta_interval -= delta; 2017410: 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; 2017414: c6 20 a0 10 st %g3, [ %g2 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 2017418: c2 26 20 74 st %g1, [ %i0 + 0x74 ] _ISR_Enable( level ); 201741c: 7f ff e3 2d call 20100d0 2017420: 01 00 00 00 nop _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2017424: 90 06 20 68 add %i0, 0x68, %o0 2017428: 40 00 11 83 call 201ba34 <_Watchdog_Insert> 201742c: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 2017430: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2017434: 80 a0 60 00 cmp %g1, 0 2017438: 12 80 00 04 bne 2017448 <_Timer_server_Schedule_operation_method+0x128> 201743c: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 2017440: 7f ff ff 33 call 201710c <_Timer_server_Reset_tod_system_watchdog> 2017444: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 2017448: 40 00 0d 56 call 201a9a0 <_Thread_Enable_dispatch> 201744c: 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 ); 2017450: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 2017454: 40 00 02 30 call 2017d14 <_Chain_Append> 2017458: 81 e8 00 00 restore =============================================================================== 020097f8 <_User_extensions_Handler_initialization>: #include #include #include void _User_extensions_Handler_initialization(void) { 20097f8: 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; 20097fc: 03 00 80 6f sethi %hi(0x201bc00), %g1 2009800: 82 10 60 5c or %g1, 0x5c, %g1 ! 201bc5c ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2009804: 05 00 80 72 sethi %hi(0x201c800), %g2 initial_extensions = Configuration.User_extension_table; 2009808: 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; 200980c: f6 00 60 38 ld [ %g1 + 0x38 ], %i3 2009810: 82 10 a3 a8 or %g2, 0x3a8, %g1 2009814: 86 00 60 04 add %g1, 4, %g3 head->previous = NULL; 2009818: c0 20 60 04 clr [ %g1 + 4 ] tail->previous = head; 200981c: 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; 2009820: c6 20 a3 a8 st %g3, [ %g2 + 0x3a8 ] 2009824: 05 00 80 72 sethi %hi(0x201c800), %g2 2009828: 82 10 a1 c4 or %g2, 0x1c4, %g1 ! 201c9c4 <_User_extensions_Switches_list> 200982c: 86 00 60 04 add %g1, 4, %g3 head->previous = NULL; 2009830: c0 20 60 04 clr [ %g1 + 4 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2009834: c6 20 a1 c4 st %g3, [ %g2 + 0x1c4 ] initial_extensions = Configuration.User_extension_table; _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { 2009838: 80 a6 a0 00 cmp %i2, 0 200983c: 02 80 00 1b be 20098a8 <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 2009840: c2 20 60 08 st %g1, [ %g1 + 8 ] extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) 2009844: 83 2e e0 02 sll %i3, 2, %g1 2009848: bb 2e e0 04 sll %i3, 4, %i5 200984c: ba 27 40 01 sub %i5, %g1, %i5 2009850: ba 07 40 1b add %i5, %i3, %i5 2009854: 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 *) 2009858: 40 00 01 66 call 2009df0 <_Workspace_Allocate_or_fatal_error> 200985c: 90 10 00 1d mov %i5, %o0 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 2009860: 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 *) 2009864: b8 10 00 08 mov %o0, %i4 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 2009868: 92 10 20 00 clr %o1 200986c: 40 00 16 fe call 200f464 2009870: ba 10 20 00 clr %i5 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 2009874: 10 80 00 0b b 20098a0 <_User_extensions_Handler_initialization+0xa8> 2009878: 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; 200987c: 90 07 20 14 add %i4, 0x14, %o0 2009880: 92 06 80 09 add %i2, %o1, %o1 2009884: 40 00 16 bc call 200f374 2009888: 94 10 20 20 mov 0x20, %o2 _User_extensions_Add_set( extension ); 200988c: 90 10 00 1c mov %i4, %o0 2009890: 40 00 0d 86 call 200cea8 <_User_extensions_Add_set> 2009894: ba 07 60 01 inc %i5 _User_extensions_Add_set_with_table (extension, &initial_extensions[i]); extension++; 2009898: 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++ ) { 200989c: 80 a7 40 1b cmp %i5, %i3 20098a0: 12 bf ff f7 bne 200987c <_User_extensions_Handler_initialization+0x84> 20098a4: 93 2f 60 05 sll %i5, 5, %o1 20098a8: 81 c7 e0 08 ret 20098ac: 81 e8 00 00 restore =============================================================================== 0200b574 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200b574: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200b578: 7f ff de a0 call 2002ff8 200b57c: 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; 200b580: 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 ); 200b584: 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 ) ) { 200b588: 80 a0 40 1c cmp %g1, %i4 200b58c: 02 80 00 1f be 200b608 <_Watchdog_Adjust+0x94> 200b590: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200b594: 02 80 00 1a be 200b5fc <_Watchdog_Adjust+0x88> 200b598: b6 10 20 01 mov 1, %i3 200b59c: 80 a6 60 01 cmp %i1, 1 200b5a0: 12 80 00 1a bne 200b608 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200b5a4: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200b5a8: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200b5ac: 10 80 00 07 b 200b5c8 <_Watchdog_Adjust+0x54> 200b5b0: b4 00 80 1a add %g2, %i2, %i2 break; case WATCHDOG_FORWARD: while ( units ) { if ( units < _Watchdog_First( header )->delta_interval ) { 200b5b4: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200b5b8: 80 a6 80 02 cmp %i2, %g2 200b5bc: 3a 80 00 05 bcc,a 200b5d0 <_Watchdog_Adjust+0x5c> 200b5c0: f6 20 60 10 st %i3, [ %g1 + 0x10 ] _Watchdog_First( header )->delta_interval -= units; 200b5c4: b4 20 80 1a sub %g2, %i2, %i2 break; 200b5c8: 10 80 00 10 b 200b608 <_Watchdog_Adjust+0x94> 200b5cc: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } else { units -= _Watchdog_First( header )->delta_interval; 200b5d0: b4 26 80 02 sub %i2, %g2, %i2 _Watchdog_First( header )->delta_interval = 1; _ISR_Enable( level ); 200b5d4: 7f ff de 8d call 2003008 200b5d8: 01 00 00 00 nop _Watchdog_Tickle( header ); 200b5dc: 40 00 00 90 call 200b81c <_Watchdog_Tickle> 200b5e0: 90 10 00 1d mov %i5, %o0 _ISR_Disable( level ); 200b5e4: 7f ff de 85 call 2002ff8 200b5e8: 01 00 00 00 nop if ( _Chain_Is_empty( header ) ) 200b5ec: c2 07 40 00 ld [ %i5 ], %g1 200b5f0: 80 a0 40 1c cmp %g1, %i4 200b5f4: 02 80 00 05 be 200b608 <_Watchdog_Adjust+0x94> 200b5f8: 01 00 00 00 nop switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200b5fc: 80 a6 a0 00 cmp %i2, 0 200b600: 32 bf ff ed bne,a 200b5b4 <_Watchdog_Adjust+0x40> <== ALWAYS TAKEN 200b604: c2 07 40 00 ld [ %i5 ], %g1 } break; } } _ISR_Enable( level ); 200b608: 7f ff de 80 call 2003008 200b60c: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02009c10 <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 2009c10: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 2009c14: 7f ff e1 5a call 200217c 2009c18: ba 10 00 18 mov %i0, %i5 previous_state = the_watchdog->state; 2009c1c: f0 06 20 08 ld [ %i0 + 8 ], %i0 switch ( previous_state ) { 2009c20: 80 a6 20 01 cmp %i0, 1 2009c24: 22 80 00 1d be,a 2009c98 <_Watchdog_Remove+0x88> 2009c28: c0 27 60 08 clr [ %i5 + 8 ] 2009c2c: 0a 80 00 1c bcs 2009c9c <_Watchdog_Remove+0x8c> 2009c30: 03 00 80 72 sethi %hi(0x201c800), %g1 2009c34: 80 a6 20 03 cmp %i0, 3 2009c38: 18 80 00 19 bgu 2009c9c <_Watchdog_Remove+0x8c> <== NEVER TAKEN 2009c3c: 01 00 00 00 nop 2009c40: c2 07 40 00 ld [ %i5 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 2009c44: c0 27 60 08 clr [ %i5 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 2009c48: c4 00 40 00 ld [ %g1 ], %g2 2009c4c: 80 a0 a0 00 cmp %g2, 0 2009c50: 02 80 00 07 be 2009c6c <_Watchdog_Remove+0x5c> 2009c54: 05 00 80 72 sethi %hi(0x201c800), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 2009c58: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 2009c5c: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 2009c60: 84 00 c0 02 add %g3, %g2, %g2 2009c64: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 2009c68: 05 00 80 72 sethi %hi(0x201c800), %g2 2009c6c: c4 00 a2 c8 ld [ %g2 + 0x2c8 ], %g2 ! 201cac8 <_Watchdog_Sync_count> 2009c70: 80 a0 a0 00 cmp %g2, 0 2009c74: 22 80 00 07 be,a 2009c90 <_Watchdog_Remove+0x80> 2009c78: c4 07 60 04 ld [ %i5 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 2009c7c: 05 00 80 73 sethi %hi(0x201cc00), %g2 2009c80: c6 00 a3 00 ld [ %g2 + 0x300 ], %g3 ! 201cf00 <_Per_CPU_Information+0x8> 2009c84: 05 00 80 72 sethi %hi(0x201c800), %g2 2009c88: c6 20 a2 68 st %g3, [ %g2 + 0x268 ] ! 201ca68 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 2009c8c: c4 07 60 04 ld [ %i5 + 4 ], %g2 next->previous = previous; 2009c90: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 2009c94: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 2009c98: 03 00 80 72 sethi %hi(0x201c800), %g1 2009c9c: c2 00 62 cc ld [ %g1 + 0x2cc ], %g1 ! 201cacc <_Watchdog_Ticks_since_boot> 2009ca0: c2 27 60 18 st %g1, [ %i5 + 0x18 ] _ISR_Enable( level ); 2009ca4: 7f ff e1 3a call 200218c 2009ca8: 01 00 00 00 nop return( previous_state ); } 2009cac: 81 c7 e0 08 ret 2009cb0: 81 e8 00 00 restore =============================================================================== 0200ad60 <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200ad60: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200ad64: 7f ff df 75 call 2002b38 200ad68: ba 10 00 18 mov %i0, %i5 200ad6c: b0 10 00 08 mov %o0, %i0 printk( "Watchdog Chain: %s %p\n", name, header ); 200ad70: 11 00 80 71 sethi %hi(0x201c400), %o0 200ad74: 94 10 00 19 mov %i1, %o2 200ad78: 90 12 23 d0 or %o0, 0x3d0, %o0 200ad7c: 7f ff e6 19 call 20045e0 200ad80: 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; 200ad84: 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 ); 200ad88: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 200ad8c: 80 a7 00 19 cmp %i4, %i1 200ad90: 12 80 00 04 bne 200ada0 <_Watchdog_Report_chain+0x40> 200ad94: 92 10 00 1c mov %i4, %o1 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 200ad98: 10 80 00 0d b 200adcc <_Watchdog_Report_chain+0x6c> 200ad9c: 11 00 80 71 sethi %hi(0x201c400), %o0 node != _Chain_Tail(header) ; node = node->next ) { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); 200ada0: 40 00 00 0f call 200addc <_Watchdog_Report> 200ada4: 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 ) 200ada8: 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 ) ; 200adac: 80 a7 00 19 cmp %i4, %i1 200adb0: 12 bf ff fc bne 200ada0 <_Watchdog_Report_chain+0x40> <== NEVER TAKEN 200adb4: 92 10 00 1c mov %i4, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200adb8: 11 00 80 71 sethi %hi(0x201c400), %o0 200adbc: 92 10 00 1d mov %i5, %o1 200adc0: 7f ff e6 08 call 20045e0 200adc4: 90 12 23 e8 or %o0, 0x3e8, %o0 200adc8: 30 80 00 03 b,a 200add4 <_Watchdog_Report_chain+0x74> } else { printk( "Chain is empty\n" ); 200adcc: 7f ff e6 05 call 20045e0 200add0: 90 12 23 f8 or %o0, 0x3f8, %o0 } _ISR_Enable( level ); 200add4: 7f ff df 5d call 2002b48 200add8: 81 e8 00 00 restore =============================================================================== 020067dc : * operation(s) cannot be canceled */ int aio_cancel(int fildes, struct aiocb *aiocbp) { 20067dc: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request_chain *r_chain; int result; pthread_mutex_lock (&aio_request_queue.mutex); 20067e0: 3b 00 80 62 sethi %hi(0x2018800), %i5 20067e4: 40 00 04 5d call 2007958 20067e8: 90 17 62 3c or %i5, 0x23c, %o0 ! 2018a3c if (fcntl (fildes, F_GETFD) < 0) { 20067ec: 90 10 00 18 mov %i0, %o0 20067f0: 40 00 1c 94 call 200da40 20067f4: 92 10 20 01 mov 1, %o1 20067f8: 80 a2 20 00 cmp %o0, 0 20067fc: 16 80 00 08 bge 200681c 2006800: 80 a6 60 00 cmp %i1, 0 pthread_mutex_unlock(&aio_request_queue.mutex); 2006804: 40 00 04 75 call 20079d8 2006808: 90 17 62 3c or %i5, 0x23c, %o0 rtems_set_errno_and_return_minus_one (EBADF); 200680c: 40 00 29 b6 call 2010ee4 <__errno> 2006810: 01 00 00 00 nop 2006814: 10 80 00 4e b 200694c 2006818: 82 10 20 09 mov 9, %g1 ! 9 } /* if aiocbp is NULL remove all request for given file descriptor */ if (aiocbp == NULL) { 200681c: 32 80 00 2f bne,a 20068d8 2006820: 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); 2006824: 11 00 80 62 sethi %hi(0x2018800), %o0 2006828: 92 10 00 18 mov %i0, %o1 200682c: 90 12 22 84 or %o0, 0x284, %o0 2006830: 40 00 00 bb call 2006b1c 2006834: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2006838: b8 92 20 00 orcc %o0, 0, %i4 200683c: 32 80 00 1a bne,a 20068a4 2006840: 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; 2006844: ba 17 62 3c or %i5, 0x23c, %i5 AIO_printf ("Request chain not on [WQ]\n"); if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2006848: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 200684c: 82 07 60 58 add %i5, 0x58, %g1 2006850: 80 a0 80 01 cmp %g2, %g1 2006854: 02 80 00 48 be 2006974 <== NEVER TAKEN 2006858: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 200685c: 92 10 00 18 mov %i0, %o1 2006860: 40 00 00 af call 2006b1c 2006864: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2006868: b8 92 20 00 orcc %o0, 0, %i4 200686c: 22 80 00 43 be,a 2006978 2006870: 90 10 00 1d mov %i5, %o0 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2006874: 40 00 0a a8 call 2009314 <_Chain_Extract> 2006878: 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); 200687c: 40 00 01 8d call 2006eb0 2006880: 90 10 00 1c mov %i4, %o0 pthread_mutex_destroy (&r_chain->mutex); 2006884: 40 00 03 90 call 20076c4 2006888: 90 10 00 19 mov %i1, %o0 pthread_cond_destroy (&r_chain->mutex); 200688c: 40 00 02 b5 call 2007360 2006890: 90 10 00 19 mov %i1, %o0 free (r_chain); 2006894: 7f ff f3 31 call 2003558 2006898: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 200689c: 10 80 00 0b b 20068c8 20068a0: 90 10 00 1d mov %i5, %o0 return AIO_ALLDONE; } AIO_printf ("Request chain on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 20068a4: 40 00 04 2d call 2007958 20068a8: 90 10 00 19 mov %i1, %o0 20068ac: 40 00 0a 9a call 2009314 <_Chain_Extract> 20068b0: 90 10 00 1c mov %i4, %o0 rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 20068b4: 40 00 01 7f call 2006eb0 20068b8: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&r_chain->mutex); 20068bc: 40 00 04 47 call 20079d8 20068c0: 90 10 00 19 mov %i1, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 20068c4: 90 17 62 3c or %i5, 0x23c, %o0 20068c8: 40 00 04 44 call 20079d8 20068cc: b0 10 20 00 clr %i0 return AIO_CANCELED; 20068d0: 81 c7 e0 08 ret 20068d4: 81 e8 00 00 restore } else { AIO_printf ("Cancel request\n"); if (aiocbp->aio_fildes != fildes) { 20068d8: 80 a7 00 18 cmp %i4, %i0 20068dc: 12 80 00 17 bne 2006938 20068e0: 90 17 62 3c or %i5, 0x23c, %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); 20068e4: 11 00 80 62 sethi %hi(0x2018800), %o0 20068e8: 92 10 00 1c mov %i4, %o1 20068ec: 90 12 22 84 or %o0, 0x284, %o0 20068f0: 40 00 00 8b call 2006b1c 20068f4: 94 10 20 00 clr %o2 if (r_chain == NULL) { 20068f8: b0 92 20 00 orcc %o0, 0, %i0 20068fc: 32 80 00 23 bne,a 2006988 2006900: b8 06 20 1c add %i0, 0x1c, %i4 2006904: ba 17 62 3c or %i5, 0x23c, %i5 if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2006908: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 200690c: 82 07 60 58 add %i5, 0x58, %g1 2006910: 80 a0 80 01 cmp %g2, %g1 2006914: 02 80 00 18 be 2006974 <== NEVER TAKEN 2006918: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 200691c: 92 10 00 1c mov %i4, %o1 2006920: 40 00 00 7f call 2006b1c 2006924: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2006928: 80 a2 20 00 cmp %o0, 0 200692c: 12 80 00 0b bne 2006958 2006930: 92 10 00 19 mov %i1, %o1 pthread_mutex_unlock (&aio_request_queue.mutex); 2006934: 90 10 00 1d mov %i5, %o0 2006938: 40 00 04 28 call 20079d8 200693c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one (EINVAL); 2006940: 40 00 29 69 call 2010ee4 <__errno> 2006944: 01 00 00 00 nop 2006948: 82 10 20 16 mov 0x16, %g1 ! 16 200694c: c2 22 00 00 st %g1, [ %o0 ] 2006950: 81 c7 e0 08 ret 2006954: 91 e8 3f ff restore %g0, -1, %o0 } AIO_printf ("Request on [IQ]\n"); result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2006958: 40 00 01 6a call 2006f00 200695c: 90 02 20 08 add %o0, 8, %o0 2006960: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&aio_request_queue.mutex); 2006964: 40 00 04 1d call 20079d8 2006968: 90 10 00 1d mov %i5, %o0 return result; 200696c: 81 c7 e0 08 ret 2006970: 81 e8 00 00 restore } else { pthread_mutex_unlock (&aio_request_queue.mutex); 2006974: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2006978: 40 00 04 18 call 20079d8 200697c: b0 10 20 02 mov 2, %i0 return AIO_ALLDONE; 2006980: 81 c7 e0 08 ret 2006984: 81 e8 00 00 restore } } AIO_printf ("Request on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2006988: 40 00 03 f4 call 2007958 200698c: 90 10 00 1c mov %i4, %o0 result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2006990: 92 10 00 19 mov %i1, %o1 2006994: 40 00 01 5b call 2006f00 2006998: 90 06 20 08 add %i0, 8, %o0 200699c: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&r_chain->mutex); 20069a0: 40 00 04 0e call 20079d8 20069a4: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 20069a8: 40 00 04 0c call 20079d8 20069ac: 90 17 62 3c or %i5, 0x23c, %o0 return result; } return AIO_ALLDONE; } 20069b0: 81 c7 e0 08 ret 20069b4: 81 e8 00 00 restore =============================================================================== 020069c0 : int aio_fsync( int op, struct aiocb *aiocbp ) { 20069c0: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; if (op != O_SYNC) 20069c4: 03 00 00 08 sethi %hi(0x2000), %g1 20069c8: 80 a6 00 01 cmp %i0, %g1 20069cc: 12 80 00 10 bne 2006a0c 20069d0: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); mode = fcntl (aiocbp->aio_fildes, F_GETFL); 20069d4: d0 06 40 00 ld [ %i1 ], %o0 20069d8: 40 00 1c 1a call 200da40 20069dc: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 20069e0: 90 0a 20 03 and %o0, 3, %o0 20069e4: 90 02 3f ff add %o0, -1, %o0 20069e8: 80 a2 20 01 cmp %o0, 1 20069ec: 18 80 00 08 bgu 2006a0c 20069f0: ba 10 20 09 mov 9, %i5 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); req = malloc (sizeof (rtems_aio_request)); 20069f4: 7f ff f4 51 call 2003b38 20069f8: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 20069fc: 80 a2 20 00 cmp %o0, 0 2006a00: 32 80 00 0b bne,a 2006a2c <== ALWAYS TAKEN 2006a04: f2 22 20 14 st %i1, [ %o0 + 0x14 ] rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 2006a08: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED 2006a0c: 82 10 3f ff mov -1, %g1 2006a10: fa 26 60 34 st %i5, [ %i1 + 0x34 ] 2006a14: c2 26 60 38 st %g1, [ %i1 + 0x38 ] 2006a18: 40 00 29 33 call 2010ee4 <__errno> 2006a1c: b0 10 3f ff mov -1, %i0 2006a20: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_SYNC; return rtems_aio_enqueue (req); } 2006a24: 81 c7 e0 08 ret 2006a28: 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; 2006a2c: 82 10 20 03 mov 3, %g1 2006a30: c2 26 60 30 st %g1, [ %i1 + 0x30 ] return rtems_aio_enqueue (req); 2006a34: 40 00 01 50 call 2006f74 2006a38: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 020071a4 : * 0 - otherwise */ int aio_read (struct aiocb *aiocbp) { 20071a4: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 20071a8: d0 06 00 00 ld [ %i0 ], %o0 20071ac: 40 00 1a 25 call 200da40 20071b0: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR))) 20071b4: 90 0a 20 03 and %o0, 3, %o0 20071b8: 80 a2 20 02 cmp %o0, 2 20071bc: 02 80 00 05 be 20071d0 20071c0: ba 10 00 18 mov %i0, %i5 20071c4: 80 a2 20 00 cmp %o0, 0 20071c8: 12 80 00 10 bne 2007208 <== ALWAYS TAKEN 20071cc: 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) 20071d0: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 20071d4: 80 a0 60 00 cmp %g1, 0 20071d8: 32 80 00 0c bne,a 2007208 20071dc: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 20071e0: c2 07 60 08 ld [ %i5 + 8 ], %g1 20071e4: 80 a0 60 00 cmp %g1, 0 20071e8: 26 80 00 08 bl,a 2007208 20071ec: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 20071f0: 7f ff f2 52 call 2003b38 20071f4: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 20071f8: 80 a2 20 00 cmp %o0, 0 20071fc: 32 80 00 0b bne,a 2007228 <== ALWAYS TAKEN 2007200: fa 22 20 14 st %i5, [ %o0 + 0x14 ] 2007204: b8 10 20 0b mov 0xb, %i4 <== NOT EXECUTED rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 2007208: 82 10 3f ff mov -1, %g1 200720c: f8 27 60 34 st %i4, [ %i5 + 0x34 ] 2007210: c2 27 60 38 st %g1, [ %i5 + 0x38 ] 2007214: 40 00 27 34 call 2010ee4 <__errno> 2007218: b0 10 3f ff mov -1, %i0 200721c: f8 22 00 00 st %i4, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_READ; return rtems_aio_enqueue (req); } 2007220: 81 c7 e0 08 ret 2007224: 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; 2007228: 82 10 20 01 mov 1, %g1 200722c: c2 27 60 30 st %g1, [ %i5 + 0x30 ] return rtems_aio_enqueue (req); 2007230: 7f ff ff 51 call 2006f74 2007234: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02007240 : * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 2007240: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2007244: d0 06 00 00 ld [ %i0 ], %o0 2007248: 40 00 19 fe call 200da40 200724c: 92 10 20 03 mov 3, %o1 * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 2007250: 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))) 2007254: 90 0a 20 03 and %o0, 3, %o0 2007258: 90 02 3f ff add %o0, -1, %o0 200725c: 80 a2 20 01 cmp %o0, 1 2007260: 18 80 00 10 bgu 20072a0 2007264: 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) 2007268: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200726c: 80 a0 60 00 cmp %g1, 0 2007270: 32 80 00 0c bne,a 20072a0 2007274: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 2007278: c2 06 20 08 ld [ %i0 + 8 ], %g1 200727c: 80 a0 60 00 cmp %g1, 0 2007280: 26 80 00 08 bl,a 20072a0 2007284: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2007288: 7f ff f2 2c call 2003b38 200728c: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2007290: 80 a2 20 00 cmp %o0, 0 2007294: 32 80 00 0b bne,a 20072c0 <== ALWAYS TAKEN 2007298: f0 22 20 14 st %i0, [ %o0 + 0x14 ] 200729c: b8 10 20 0b mov 0xb, %i4 <== NOT EXECUTED rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 20072a0: 82 10 3f ff mov -1, %g1 20072a4: f8 27 60 34 st %i4, [ %i5 + 0x34 ] 20072a8: c2 27 60 38 st %g1, [ %i5 + 0x38 ] 20072ac: 40 00 27 0e call 2010ee4 <__errno> 20072b0: b0 10 3f ff mov -1, %i0 20072b4: f8 22 00 00 st %i4, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_WRITE; return rtems_aio_enqueue (req); } 20072b8: 81 c7 e0 08 ret 20072bc: 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; 20072c0: 82 10 20 02 mov 2, %g1 20072c4: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 20072c8: 7f ff ff 2b call 2006f74 20072cc: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02005e10 : int clock_gettime( clockid_t clock_id, struct timespec *tp ) { 2005e10: 9d e3 bf a0 save %sp, -96, %sp if ( !tp ) 2005e14: 90 96 60 00 orcc %i1, 0, %o0 2005e18: 12 80 00 06 bne 2005e30 2005e1c: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); 2005e20: 40 00 26 09 call 200f644 <__errno> 2005e24: 01 00 00 00 nop 2005e28: 10 80 00 15 b 2005e7c 2005e2c: 82 10 20 16 mov 0x16, %g1 ! 16 if ( clock_id == CLOCK_REALTIME ) { 2005e30: 12 80 00 05 bne 2005e44 2005e34: 80 a6 20 04 cmp %i0, 4 _TOD_Get(tp); 2005e38: 40 00 07 ca call 2007d60 <_TOD_Get> 2005e3c: b0 10 20 00 clr %i0 2005e40: 30 80 00 16 b,a 2005e98 return 0; } #ifdef CLOCK_MONOTONIC if ( clock_id == CLOCK_MONOTONIC ) { 2005e44: 02 80 00 05 be 2005e58 <== NEVER TAKEN 2005e48: 01 00 00 00 nop return 0; } #endif #ifdef _POSIX_CPUTIME if ( clock_id == CLOCK_PROCESS_CPUTIME_ID ) { 2005e4c: 80 a6 20 02 cmp %i0, 2 2005e50: 12 80 00 06 bne 2005e68 2005e54: 80 a6 20 03 cmp %i0, 3 _TOD_Get_uptime_as_timespec( tp ); 2005e58: 40 00 07 de call 2007dd0 <_TOD_Get_uptime_as_timespec> 2005e5c: b0 10 20 00 clr %i0 return 0; 2005e60: 81 c7 e0 08 ret 2005e64: 81 e8 00 00 restore } #endif #ifdef _POSIX_THREAD_CPUTIME if ( clock_id == CLOCK_THREAD_CPUTIME_ID ) 2005e68: 12 80 00 08 bne 2005e88 2005e6c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); 2005e70: 40 00 25 f5 call 200f644 <__errno> 2005e74: 01 00 00 00 nop 2005e78: 82 10 20 58 mov 0x58, %g1 ! 58 2005e7c: c2 22 00 00 st %g1, [ %o0 ] 2005e80: 81 c7 e0 08 ret 2005e84: 91 e8 3f ff restore %g0, -1, %o0 #endif rtems_set_errno_and_return_minus_one( EINVAL ); 2005e88: 40 00 25 ef call 200f644 <__errno> 2005e8c: b0 10 3f ff mov -1, %i0 2005e90: 82 10 20 16 mov 0x16, %g1 2005e94: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2005e98: 81 c7 e0 08 ret 2005e9c: 81 e8 00 00 restore =============================================================================== 02005ea0 : int clock_settime( clockid_t clock_id, const struct timespec *tp ) { 2005ea0: 9d e3 bf a0 save %sp, -96, %sp if ( !tp ) 2005ea4: 90 96 60 00 orcc %i1, 0, %o0 2005ea8: 02 80 00 0b be 2005ed4 <== NEVER TAKEN 2005eac: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 2005eb0: 80 a6 20 01 cmp %i0, 1 2005eb4: 12 80 00 16 bne 2005f0c 2005eb8: 80 a6 20 02 cmp %i0, 2 if ( tp->tv_sec < TOD_SECONDS_1970_THROUGH_1988 ) 2005ebc: c4 02 00 00 ld [ %o0 ], %g2 2005ec0: 03 08 76 b9 sethi %hi(0x21dae400), %g1 2005ec4: 82 10 60 ff or %g1, 0xff, %g1 ! 21dae4ff 2005ec8: 80 a0 80 01 cmp %g2, %g1 2005ecc: 38 80 00 06 bgu,a 2005ee4 2005ed0: 03 00 80 65 sethi %hi(0x2019400), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 2005ed4: 40 00 25 dc call 200f644 <__errno> 2005ed8: 01 00 00 00 nop 2005edc: 10 80 00 14 b 2005f2c 2005ee0: 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++; 2005ee4: c4 00 60 60 ld [ %g1 + 0x60 ], %g2 2005ee8: 84 00 a0 01 inc %g2 2005eec: c4 20 60 60 st %g2, [ %g1 + 0x60 ] return _Thread_Dispatch_disable_level; 2005ef0: c2 00 60 60 ld [ %g1 + 0x60 ], %g1 _Thread_Disable_dispatch(); _TOD_Set( tp ); 2005ef4: 40 00 07 cd call 2007e28 <_TOD_Set> 2005ef8: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 2005efc: 40 00 0e 01 call 2009700 <_Thread_Enable_dispatch> 2005f00: 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; 2005f04: 81 c7 e0 08 ret 2005f08: 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 ) 2005f0c: 02 80 00 05 be 2005f20 2005f10: 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 ) 2005f14: 80 a6 20 03 cmp %i0, 3 2005f18: 12 80 00 08 bne 2005f38 2005f1c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); 2005f20: 40 00 25 c9 call 200f644 <__errno> 2005f24: 01 00 00 00 nop 2005f28: 82 10 20 58 mov 0x58, %g1 ! 58 2005f2c: c2 22 00 00 st %g1, [ %o0 ] 2005f30: 81 c7 e0 08 ret 2005f34: 91 e8 3f ff restore %g0, -1, %o0 #endif else rtems_set_errno_and_return_minus_one( EINVAL ); 2005f38: 40 00 25 c3 call 200f644 <__errno> 2005f3c: b0 10 3f ff mov -1, %i0 2005f40: 82 10 20 16 mov 0x16, %g1 2005f44: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2005f48: 81 c7 e0 08 ret 2005f4c: 81 e8 00 00 restore =============================================================================== 020193d4 : int killinfo( pid_t pid, int sig, const union sigval *value ) { 20193d4: 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() ) 20193d8: 7f ff fe f2 call 2018fa0 20193dc: 01 00 00 00 nop 20193e0: 80 a6 00 08 cmp %i0, %o0 20193e4: 02 80 00 06 be 20193fc 20193e8: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); 20193ec: 7f ff d5 86 call 200ea04 <__errno> 20193f0: 01 00 00 00 nop 20193f4: 10 80 00 a5 b 2019688 20193f8: 82 10 20 03 mov 3, %g1 ! 3 /* * Validate the signal passed. */ if ( !sig ) 20193fc: 02 80 00 06 be 2019414 2019400: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 2019404: ba 06 7f ff add %i1, -1, %i5 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 2019408: 80 a7 60 1f cmp %i5, 0x1f 201940c: 28 80 00 06 bleu,a 2019424 2019410: 83 2e 60 02 sll %i1, 2, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 2019414: 7f ff d5 7c call 200ea04 <__errno> 2019418: 01 00 00 00 nop 201941c: 10 80 00 9b b 2019688 2019420: 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 ) 2019424: 85 2e 60 04 sll %i1, 4, %g2 2019428: 84 20 80 01 sub %g2, %g1, %g2 201942c: 03 00 80 73 sethi %hi(0x201cc00), %g1 2019430: 82 10 63 50 or %g1, 0x350, %g1 ! 201cf50 <_POSIX_signals_Vectors> 2019434: 82 00 40 02 add %g1, %g2, %g1 2019438: c2 00 60 08 ld [ %g1 + 8 ], %g1 201943c: 80 a0 60 01 cmp %g1, 1 2019440: 02 80 00 7b be 201962c 2019444: 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 ) ) 2019448: 80 a6 60 04 cmp %i1, 4 201944c: 02 80 00 06 be 2019464 2019450: 80 a6 60 08 cmp %i1, 8 2019454: 02 80 00 04 be 2019464 2019458: 80 a6 60 0b cmp %i1, 0xb 201945c: 12 80 00 08 bne 201947c 2019460: 82 10 20 01 mov 1, %g1 return pthread_kill( pthread_self(), sig ); 2019464: 40 00 01 2e call 201991c 2019468: 01 00 00 00 nop 201946c: 40 00 00 f2 call 2019834 2019470: 92 10 00 19 mov %i1, %o1 2019474: 81 c7 e0 08 ret 2019478: 91 e8 00 08 restore %g0, %o0, %o0 /* * Build up a siginfo structure */ siginfo = &siginfo_struct; siginfo->si_signo = sig; 201947c: f2 27 bf f4 st %i1, [ %fp + -12 ] siginfo->si_code = SI_USER; 2019480: c2 27 bf f8 st %g1, [ %fp + -8 ] if ( !value ) { 2019484: 80 a6 a0 00 cmp %i2, 0 2019488: 12 80 00 04 bne 2019498 201948c: bb 28 40 1d sll %g1, %i5, %i5 siginfo->si_value.sival_int = 0; 2019490: 10 80 00 04 b 20194a0 2019494: c0 27 bf fc clr [ %fp + -4 ] } else { siginfo->si_value = *value; 2019498: c2 06 80 00 ld [ %i2 ], %g1 201949c: 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++; 20194a0: 03 00 80 72 sethi %hi(0x201c800), %g1 20194a4: c4 00 61 c0 ld [ %g1 + 0x1c0 ], %g2 ! 201c9c0 <_Thread_Dispatch_disable_level> 20194a8: 84 00 a0 01 inc %g2 20194ac: c4 20 61 c0 st %g2, [ %g1 + 0x1c0 ] return _Thread_Dispatch_disable_level; 20194b0: c2 00 61 c0 ld [ %g1 + 0x1c0 ], %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; 20194b4: 03 00 80 73 sethi %hi(0x201cc00), %g1 20194b8: d0 00 63 04 ld [ %g1 + 0x304 ], %o0 ! 201cf04 <_Per_CPU_Information+0xc> api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( _POSIX_signals_Is_interested( api, mask ) ) { 20194bc: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 20194c0: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 20194c4: 80 af 40 01 andncc %i5, %g1, %g0 20194c8: 12 80 00 51 bne 201960c 20194cc: 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; 20194d0: d0 00 60 dc ld [ %g1 + 0xdc ], %o0 ! 201d0dc <_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 ); 20194d4: 03 00 80 74 sethi %hi(0x201d000), %g1 20194d8: 10 80 00 0a b 2019500 20194dc: 82 10 60 e0 or %g1, 0xe0, %g1 ! 201d0e0 <_POSIX_signals_Wait_queue+0x4> #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 20194e0: 80 8f 40 03 btst %i5, %g3 20194e4: 12 80 00 4a bne 201960c 20194e8: 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) 20194ec: c4 00 a0 d0 ld [ %g2 + 0xd0 ], %g2 20194f0: 80 af 40 02 andncc %i5, %g2, %g0 20194f4: 12 80 00 47 bne 2019610 20194f8: 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 ) { 20194fc: 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 ); 2019500: 80 a2 00 01 cmp %o0, %g1 2019504: 32 bf ff f7 bne,a 20194e0 2019508: c6 02 20 30 ld [ %o0 + 0x30 ], %g3 * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 201950c: 03 00 80 6f sethi %hi(0x201bc00), %g1 2019510: c4 08 60 9c ldub [ %g1 + 0x9c ], %g2 ! 201bc9c * * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; 2019514: 90 10 20 00 clr %o0 interested_priority = PRIORITY_MAXIMUM + 1; 2019518: 84 00 a0 01 inc %g2 for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) { 201951c: 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 ] ) 2019520: 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); 2019524: 31 04 00 00 sethi %hi(0x10000000), %i0 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 2019528: 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 ] ) 201952c: 86 13 21 28 or %o4, 0x128, %g3 2019530: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 2019534: 80 a0 60 00 cmp %g1, 0 2019538: 22 80 00 2f be,a 20195f4 <== NEVER TAKEN 201953c: 88 01 20 01 inc %g4 <== NOT EXECUTED continue; the_info = _Objects_Information_table[ the_api ][ 1 ]; 2019540: 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++ ) { 2019544: b4 10 20 01 mov 1, %i2 */ if ( !the_info ) continue; #endif maximum = the_info->maximum; 2019548: d4 10 60 10 lduh [ %g1 + 0x10 ], %o2 object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 201954c: 10 80 00 26 b 20195e4 2019550: d6 00 60 1c ld [ %g1 + 0x1c ], %o3 the_thread = (Thread_Control *) object_table[ index ]; 2019554: c2 02 c0 01 ld [ %o3 + %g1 ], %g1 if ( !the_thread ) 2019558: 80 a0 60 00 cmp %g1, 0 201955c: 22 80 00 22 be,a 20195e4 2019560: 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 ) 2019564: c6 00 60 14 ld [ %g1 + 0x14 ], %g3 2019568: 80 a0 c0 02 cmp %g3, %g2 201956c: 38 80 00 1e bgu,a 20195e4 2019570: b4 06 a0 01 inc %i2 #if defined(RTEMS_DEBUG) if ( !api ) continue; #endif if ( !_POSIX_signals_Is_interested( api, mask ) ) 2019574: de 00 61 5c ld [ %g1 + 0x15c ], %o7 2019578: de 03 e0 d0 ld [ %o7 + 0xd0 ], %o7 201957c: 80 af 40 0f andncc %i5, %o7, %g0 2019580: 22 80 00 19 be,a 20195e4 2019584: 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 ) { 2019588: 80 a0 c0 02 cmp %g3, %g2 201958c: 2a 80 00 14 bcs,a 20195dc 2019590: 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 ) ) { 2019594: 80 a2 20 00 cmp %o0, 0 2019598: 22 80 00 13 be,a 20195e4 <== NEVER TAKEN 201959c: b4 06 a0 01 inc %i2 <== NOT EXECUTED 20195a0: da 02 20 10 ld [ %o0 + 0x10 ], %o5 20195a4: 80 a3 60 00 cmp %o5, 0 20195a8: 22 80 00 0f be,a 20195e4 <== NEVER TAKEN 20195ac: b4 06 a0 01 inc %i2 <== NOT EXECUTED /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 20195b0: de 00 60 10 ld [ %g1 + 0x10 ], %o7 20195b4: 80 a3 e0 00 cmp %o7, 0 20195b8: 22 80 00 09 be,a 20195dc 20195bc: 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) ) { 20195c0: 80 8b 40 18 btst %o5, %i0 20195c4: 32 80 00 08 bne,a 20195e4 20195c8: b4 06 a0 01 inc %i2 DEBUG_STEP("7"); if ( _States_Is_interruptible_by_signal(the_thread->current_state) ) { 20195cc: 80 8b c0 18 btst %o7, %i0 20195d0: 22 80 00 05 be,a 20195e4 20195d4: 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 ) ) { 20195d8: 84 10 00 03 mov %g3, %g2 20195dc: 90 10 00 01 mov %g1, %o0 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 20195e0: b4 06 a0 01 inc %i2 20195e4: 80 a6 80 0a cmp %i2, %o2 20195e8: 08 bf ff db bleu 2019554 20195ec: 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++) { 20195f0: 88 01 20 01 inc %g4 20195f4: 80 a1 20 04 cmp %g4, 4 20195f8: 12 bf ff cd bne 201952c 20195fc: 83 29 20 02 sll %g4, 2, %g1 } } } } if ( interested ) { 2019600: 80 a2 20 00 cmp %o0, 0 2019604: 02 80 00 0c be 2019634 2019608: 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 ) ) { 201960c: 92 10 00 19 mov %i1, %o1 2019610: 40 00 00 36 call 20196e8 <_POSIX_signals_Unblock_thread> 2019614: 94 07 bf f4 add %fp, -12, %o2 2019618: 80 8a 20 ff btst 0xff, %o0 201961c: 02 80 00 06 be 2019634 2019620: 01 00 00 00 nop _Thread_Enable_dispatch(); 2019624: 7f ff bd ab call 2008cd0 <_Thread_Enable_dispatch> 2019628: b0 10 20 00 clr %i0 ! 0 return 0; 201962c: 81 c7 e0 08 ret 2019630: 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 ); 2019634: 40 00 00 24 call 20196c4 <_POSIX_signals_Set_process_signals> 2019638: 90 10 00 1d mov %i5, %o0 if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { 201963c: 83 2e 60 02 sll %i1, 2, %g1 2019640: b3 2e 60 04 sll %i1, 4, %i1 2019644: b2 26 40 01 sub %i1, %g1, %i1 2019648: 03 00 80 73 sethi %hi(0x201cc00), %g1 201964c: 82 10 63 50 or %g1, 0x350, %g1 ! 201cf50 <_POSIX_signals_Vectors> 2019650: c2 00 40 19 ld [ %g1 + %i1 ], %g1 2019654: 80 a0 60 02 cmp %g1, 2 2019658: 12 80 00 17 bne 20196b4 201965c: 11 00 80 74 sethi %hi(0x201d000), %o0 psiginfo = (POSIX_signals_Siginfo_node *) 2019660: 7f ff b6 33 call 2006f2c <_Chain_Get> 2019664: 90 12 20 d0 or %o0, 0xd0, %o0 ! 201d0d0 <_POSIX_signals_Inactive_siginfo> _Chain_Get( &_POSIX_signals_Inactive_siginfo ); if ( !psiginfo ) { 2019668: ba 92 20 00 orcc %o0, 0, %i5 201966c: 12 80 00 0a bne 2019694 2019670: 92 07 bf f4 add %fp, -12, %o1 _Thread_Enable_dispatch(); 2019674: 7f ff bd 97 call 2008cd0 <_Thread_Enable_dispatch> 2019678: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EAGAIN ); 201967c: 7f ff d4 e2 call 200ea04 <__errno> 2019680: 01 00 00 00 nop 2019684: 82 10 20 0b mov 0xb, %g1 ! b 2019688: c2 22 00 00 st %g1, [ %o0 ] 201968c: 81 c7 e0 08 ret 2019690: 91 e8 3f ff restore %g0, -1, %o0 } psiginfo->Info = *siginfo; 2019694: 90 07 60 08 add %i5, 8, %o0 2019698: 7f ff d7 37 call 200f374 201969c: 94 10 20 0c mov 0xc, %o2 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 20196a0: 11 00 80 74 sethi %hi(0x201d000), %o0 20196a4: 92 10 00 1d mov %i5, %o1 20196a8: 90 12 21 48 or %o0, 0x148, %o0 20196ac: 7f ff b6 0c call 2006edc <_Chain_Append> 20196b0: 90 02 00 19 add %o0, %i1, %o0 } DEBUG_STEP("\n"); _Thread_Enable_dispatch(); 20196b4: 7f ff bd 87 call 2008cd0 <_Thread_Enable_dispatch> 20196b8: b0 10 20 00 clr %i0 return 0; } 20196bc: 81 c7 e0 08 ret 20196c0: 81 e8 00 00 restore =============================================================================== 0200b634 : int pthread_attr_setschedpolicy( pthread_attr_t *attr, int policy ) { 200b634: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 200b638: 80 a0 60 00 cmp %g1, 0 200b63c: 02 80 00 0f be 200b678 200b640: 90 10 20 16 mov 0x16, %o0 200b644: c4 00 40 00 ld [ %g1 ], %g2 200b648: 80 a0 a0 00 cmp %g2, 0 200b64c: 02 80 00 0b be 200b678 200b650: 80 a2 60 04 cmp %o1, 4 return EINVAL; switch ( policy ) { 200b654: 18 80 00 09 bgu 200b678 200b658: 90 10 20 86 mov 0x86, %o0 200b65c: 84 10 20 01 mov 1, %g2 200b660: 85 28 80 09 sll %g2, %o1, %g2 200b664: 80 88 a0 17 btst 0x17, %g2 200b668: 02 80 00 04 be 200b678 <== NEVER TAKEN 200b66c: 01 00 00 00 nop case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: case SCHED_SPORADIC: attr->schedpolicy = policy; 200b670: d2 20 60 14 st %o1, [ %g1 + 0x14 ] 200b674: 90 10 20 00 clr %o0 return 0; default: return ENOTSUP; } } 200b678: 81 c3 e0 08 retl =============================================================================== 020063ec : int pthread_barrier_init( pthread_barrier_t *barrier, const pthread_barrierattr_t *attr, unsigned int count ) { 20063ec: 9d e3 bf 90 save %sp, -112, %sp 20063f0: ba 10 00 18 mov %i0, %i5 const pthread_barrierattr_t *the_attr; /* * Error check parameters */ if ( !barrier ) 20063f4: 80 a7 60 00 cmp %i5, 0 20063f8: 02 80 00 20 be 2006478 20063fc: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( count == 0 ) 2006400: 80 a6 a0 00 cmp %i2, 0 2006404: 02 80 00 1d be 2006478 2006408: 80 a6 60 00 cmp %i1, 0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 200640c: 32 80 00 06 bne,a 2006424 2006410: c2 06 40 00 ld [ %i1 ], %g1 the_attr = attr; } else { (void) pthread_barrierattr_init( &my_attr ); 2006414: 90 07 bf f8 add %fp, -8, %o0 2006418: 7f ff ff bd call 200630c 200641c: 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 ) 2006420: c2 06 40 00 ld [ %i1 ], %g1 2006424: 80 a0 60 00 cmp %g1, 0 2006428: 02 80 00 14 be 2006478 200642c: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 2006430: c2 06 60 04 ld [ %i1 + 4 ], %g1 2006434: 80 a0 60 00 cmp %g1, 0 2006438: 12 80 00 10 bne 2006478 <== NEVER TAKEN 200643c: 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++; 2006440: c4 00 60 a0 ld [ %g1 + 0xa0 ], %g2 ! 20174a0 <_Thread_Dispatch_disable_level> } /* * Convert from POSIX attributes to Core Barrier attributes */ the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE; 2006444: c0 27 bf f0 clr [ %fp + -16 ] the_attributes.maximum_count = count; 2006448: f4 27 bf f4 st %i2, [ %fp + -12 ] 200644c: 84 00 a0 01 inc %g2 2006450: c4 20 60 a0 st %g2, [ %g1 + 0xa0 ] return _Thread_Dispatch_disable_level; 2006454: c2 00 60 a0 ld [ %g1 + 0xa0 ], %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 *) 2006458: 37 00 80 5e sethi %hi(0x2017800), %i3 200645c: 40 00 08 5d call 20085d0 <_Objects_Allocate> 2006460: 90 16 e0 60 or %i3, 0x60, %o0 ! 2017860 <_POSIX_Barrier_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _POSIX_Barrier_Allocate(); if ( !the_barrier ) { 2006464: b8 92 20 00 orcc %o0, 0, %i4 2006468: 12 80 00 06 bne 2006480 200646c: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); 2006470: 40 00 0d 24 call 2009900 <_Thread_Enable_dispatch> 2006474: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2006478: 81 c7 e0 08 ret 200647c: 81 e8 00 00 restore } _CORE_barrier_Initialize( &the_barrier->Barrier, &the_attributes ); 2006480: 40 00 05 c4 call 2007b90 <_CORE_barrier_Initialize> 2006484: 92 07 bf f0 add %fp, -16, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006488: 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; } 200648c: b6 16 e0 60 or %i3, 0x60, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006490: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006494: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006498: 85 28 a0 02 sll %g2, 2, %g2 200649c: 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; 20064a0: c0 27 20 0c clr [ %i4 + 0xc ] ); /* * Exit the critical section and return the user an operational barrier */ *barrier = the_barrier->Object.id; 20064a4: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 20064a8: 40 00 0d 16 call 2009900 <_Thread_Enable_dispatch> 20064ac: b0 10 20 00 clr %i0 return 0; } 20064b0: 81 c7 e0 08 ret 20064b4: 81 e8 00 00 restore =============================================================================== 02005c74 : void pthread_cleanup_push( void (*routine)( void * ), void *arg ) { 2005c74: 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 ) 2005c78: 80 a6 20 00 cmp %i0, 0 2005c7c: 02 80 00 15 be 2005cd0 2005c80: 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++; 2005c84: 03 00 80 5e sethi %hi(0x2017800), %g1 2005c88: c4 00 61 80 ld [ %g1 + 0x180 ], %g2 ! 2017980 <_Thread_Dispatch_disable_level> 2005c8c: 84 00 a0 01 inc %g2 2005c90: c4 20 61 80 st %g2, [ %g1 + 0x180 ] return _Thread_Dispatch_disable_level; 2005c94: c2 00 61 80 ld [ %g1 + 0x180 ], %g1 return; _Thread_Disable_dispatch(); handler = _Workspace_Allocate( sizeof( POSIX_Cancel_Handler_control ) ); 2005c98: 40 00 11 c1 call 200a39c <_Workspace_Allocate> 2005c9c: 90 10 20 10 mov 0x10, %o0 if ( handler ) { 2005ca0: 92 92 20 00 orcc %o0, 0, %o1 2005ca4: 02 80 00 09 be 2005cc8 <== NEVER TAKEN 2005ca8: 01 00 00 00 nop thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 2005cac: 03 00 80 5f sethi %hi(0x2017c00), %g1 2005cb0: c2 00 62 c4 ld [ %g1 + 0x2c4 ], %g1 ! 2017ec4 <_Per_CPU_Information+0xc> handler_stack = &thread_support->Cancellation_Handlers; 2005cb4: d0 00 61 5c ld [ %g1 + 0x15c ], %o0 handler->routine = routine; 2005cb8: f0 22 60 08 st %i0, [ %o1 + 8 ] handler->arg = arg; 2005cbc: f2 22 60 0c st %i1, [ %o1 + 0xc ] _Chain_Append( handler_stack, &handler->Node ); 2005cc0: 40 00 05 ff call 20074bc <_Chain_Append> 2005cc4: 90 02 20 e4 add %o0, 0xe4, %o0 } _Thread_Enable_dispatch(); 2005cc8: 40 00 0d 4f call 2009204 <_Thread_Enable_dispatch> 2005ccc: 81 e8 00 00 restore 2005cd0: 81 c7 e0 08 ret 2005cd4: 81 e8 00 00 restore =============================================================================== 02006c3c : int pthread_cond_init( pthread_cond_t *cond, const pthread_condattr_t *attr ) { 2006c3c: 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; 2006c40: 80 a6 60 00 cmp %i1, 0 2006c44: 12 80 00 04 bne 2006c54 2006c48: ba 10 00 18 mov %i0, %i5 else the_attr = &_POSIX_Condition_variables_Default_attributes; 2006c4c: 33 00 80 5b sethi %hi(0x2016c00), %i1 2006c50: b2 16 61 94 or %i1, 0x194, %i1 ! 2016d94 <_POSIX_Condition_variables_Default_attributes> /* * Be careful about attributes when global!!! */ if ( the_attr->process_shared == PTHREAD_PROCESS_SHARED ) 2006c54: c2 06 60 04 ld [ %i1 + 4 ], %g1 2006c58: 80 a0 60 01 cmp %g1, 1 2006c5c: 02 80 00 12 be 2006ca4 <== NEVER TAKEN 2006c60: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !the_attr->is_initialized ) 2006c64: c2 06 40 00 ld [ %i1 ], %g1 2006c68: 80 a0 60 00 cmp %g1, 0 2006c6c: 02 80 00 0e be 2006ca4 2006c70: 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++; 2006c74: c4 00 61 d0 ld [ %g1 + 0x1d0 ], %g2 ! 20185d0 <_Thread_Dispatch_disable_level> 2006c78: 84 00 a0 01 inc %g2 2006c7c: c4 20 61 d0 st %g2, [ %g1 + 0x1d0 ] return _Thread_Dispatch_disable_level; 2006c80: c2 00 61 d0 ld [ %g1 + 0x1d0 ], %g1 */ RTEMS_INLINE_ROUTINE POSIX_Condition_variables_Control *_POSIX_Condition_variables_Allocate( void ) { return (POSIX_Condition_variables_Control *) 2006c84: 37 00 80 62 sethi %hi(0x2018800), %i3 2006c88: 40 00 09 be call 2009380 <_Objects_Allocate> 2006c8c: 90 16 e2 28 or %i3, 0x228, %o0 ! 2018a28 <_POSIX_Condition_variables_Information> _Thread_Disable_dispatch(); the_cond = _POSIX_Condition_variables_Allocate(); if ( !the_cond ) { 2006c90: b8 92 20 00 orcc %o0, 0, %i4 2006c94: 32 80 00 06 bne,a 2006cac 2006c98: c2 06 60 04 ld [ %i1 + 4 ], %g1 _Thread_Enable_dispatch(); 2006c9c: 40 00 0e 85 call 200a6b0 <_Thread_Enable_dispatch> 2006ca0: b0 10 20 0c mov 0xc, %i0 return ENOMEM; 2006ca4: 81 c7 e0 08 ret 2006ca8: 81 e8 00 00 restore the_cond->process_shared = the_attr->process_shared; the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 2006cac: 90 07 20 18 add %i4, 0x18, %o0 if ( !the_cond ) { _Thread_Enable_dispatch(); return ENOMEM; } the_cond->process_shared = the_attr->process_shared; 2006cb0: c2 27 20 10 st %g1, [ %i4 + 0x10 ] the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 2006cb4: 92 10 20 00 clr %o1 2006cb8: 15 04 00 02 sethi %hi(0x10000800), %o2 2006cbc: 96 10 20 74 mov 0x74, %o3 2006cc0: 40 00 10 79 call 200aea4 <_Thread_queue_Initialize> 2006cc4: c0 27 20 14 clr [ %i4 + 0x14 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006cc8: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 *cond = the_cond->Object.id; _Thread_Enable_dispatch(); return 0; } 2006ccc: b6 16 e2 28 or %i3, 0x228, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006cd0: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006cd4: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006cd8: 85 28 a0 02 sll %g2, 2, %g2 2006cdc: 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; 2006ce0: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_Condition_variables_Information, &the_cond->Object, 0 ); *cond = the_cond->Object.id; 2006ce4: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2006ce8: 40 00 0e 72 call 200a6b0 <_Thread_Enable_dispatch> 2006cec: b0 10 20 00 clr %i0 return 0; } 2006cf0: 81 c7 e0 08 ret 2006cf4: 81 e8 00 00 restore =============================================================================== 02006aa8 : */ int pthread_condattr_destroy( pthread_condattr_t *attr ) { 2006aa8: 82 10 00 08 mov %o0, %g1 if ( !attr || attr->is_initialized == false ) 2006aac: 80 a0 60 00 cmp %g1, 0 2006ab0: 02 80 00 08 be 2006ad0 2006ab4: 90 10 20 16 mov 0x16, %o0 2006ab8: c4 00 40 00 ld [ %g1 ], %g2 2006abc: 80 a0 a0 00 cmp %g2, 0 2006ac0: 02 80 00 04 be 2006ad0 <== NEVER TAKEN 2006ac4: 01 00 00 00 nop return EINVAL; attr->is_initialized = false; 2006ac8: c0 20 40 00 clr [ %g1 ] return 0; 2006acc: 90 10 20 00 clr %o0 } 2006ad0: 81 c3 e0 08 retl =============================================================================== 020060c0 : pthread_t *thread, const pthread_attr_t *attr, void *(*start_routine)( void * ), void *arg ) { 20060c0: 9d e3 bf 58 save %sp, -168, %sp 20060c4: ba 10 00 18 mov %i0, %i5 int schedpolicy = SCHED_RR; struct sched_param schedparam; Objects_Name name; int rc; if ( !start_routine ) 20060c8: 80 a6 a0 00 cmp %i2, 0 20060cc: 02 80 00 66 be 2006264 20060d0: b0 10 20 0e mov 0xe, %i0 return EFAULT; the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes; 20060d4: 80 a6 60 00 cmp %i1, 0 20060d8: 32 80 00 05 bne,a 20060ec 20060dc: c2 06 40 00 ld [ %i1 ], %g1 20060e0: 33 00 80 6e sethi %hi(0x201b800), %i1 20060e4: b2 16 61 3c or %i1, 0x13c, %i1 ! 201b93c <_POSIX_Threads_Default_attributes> if ( !the_attr->is_initialized ) 20060e8: c2 06 40 00 ld [ %i1 ], %g1 20060ec: 80 a0 60 00 cmp %g1, 0 20060f0: 02 80 00 5d be 2006264 20060f4: 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) ) 20060f8: c2 06 60 04 ld [ %i1 + 4 ], %g1 20060fc: 80 a0 60 00 cmp %g1, 0 2006100: 02 80 00 07 be 200611c 2006104: 03 00 80 71 sethi %hi(0x201c400), %g1 2006108: c4 06 60 08 ld [ %i1 + 8 ], %g2 200610c: c2 00 62 70 ld [ %g1 + 0x270 ], %g1 2006110: 80 a0 80 01 cmp %g2, %g1 2006114: 0a 80 00 79 bcs 20062f8 2006118: 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 ) { 200611c: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 2006120: 80 a0 60 01 cmp %g1, 1 2006124: 02 80 00 06 be 200613c 2006128: 80 a0 60 02 cmp %g1, 2 200612c: 12 80 00 4e bne 2006264 2006130: b0 10 20 16 mov 0x16, %i0 schedpolicy = api->schedpolicy; schedparam = api->schedparam; break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; 2006134: 10 80 00 09 b 2006158 2006138: 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 ]; 200613c: 03 00 80 76 sethi %hi(0x201d800), %g1 2006140: c2 00 60 94 ld [ %g1 + 0x94 ], %g1 ! 201d894 <_Per_CPU_Information+0xc> schedpolicy = api->schedpolicy; schedparam = api->schedparam; 2006144: 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 ]; 2006148: d2 00 61 5c ld [ %g1 + 0x15c ], %o1 schedpolicy = api->schedpolicy; 200614c: e0 02 60 84 ld [ %o1 + 0x84 ], %l0 schedparam = api->schedparam; 2006150: 10 80 00 04 b 2006160 2006154: 92 02 60 88 add %o1, 0x88, %o1 break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; schedparam = the_attr->schedparam; 2006158: 90 07 bf dc add %fp, -36, %o0 200615c: 92 06 60 18 add %i1, 0x18, %o1 2006160: 40 00 26 67 call 200fafc 2006164: 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 ) 2006168: c2 06 60 0c ld [ %i1 + 0xc ], %g1 200616c: 80 a0 60 00 cmp %g1, 0 2006170: 12 80 00 3d bne 2006264 2006174: b0 10 20 86 mov 0x86, %i0 return ENOTSUP; /* * Interpret the scheduling parameters. */ if ( !_POSIX_Priority_Is_valid( schedparam.sched_priority ) ) 2006178: d0 07 bf dc ld [ %fp + -36 ], %o0 200617c: 40 00 1a 08 call 200c99c <_POSIX_Priority_Is_valid> 2006180: b0 10 20 16 mov 0x16, %i0 2006184: 80 8a 20 ff btst 0xff, %o0 2006188: 02 80 00 37 be 2006264 <== NEVER TAKEN 200618c: 03 00 80 71 sethi %hi(0x201c400), %g1 return EINVAL; core_priority = _POSIX_Priority_To_core( schedparam.sched_priority ); 2006190: 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); 2006194: e2 08 62 6c ldub [ %g1 + 0x26c ], %l1 /* * Set the core scheduling policy information. */ rc = _POSIX_Thread_Translate_sched_param( 2006198: 90 10 00 10 mov %l0, %o0 200619c: 92 07 bf dc add %fp, -36, %o1 20061a0: 94 07 bf f8 add %fp, -8, %o2 20061a4: 40 00 1a 09 call 200c9c8 <_POSIX_Thread_Translate_sched_param> 20061a8: 96 07 bf fc add %fp, -4, %o3 schedpolicy, &schedparam, &budget_algorithm, &budget_callout ); if ( rc ) 20061ac: b0 92 20 00 orcc %o0, 0, %i0 20061b0: 12 80 00 2d bne 2006264 20061b4: 27 00 80 74 sethi %hi(0x201d000), %l3 #endif /* * Lock the allocator mutex for protection */ _RTEMS_Lock_allocator(); 20061b8: 40 00 06 04 call 20079c8 <_API_Mutex_Lock> 20061bc: d0 04 e3 f4 ld [ %l3 + 0x3f4 ], %o0 ! 201d3f4 <_RTEMS_Allocator_Mutex> * _POSIX_Threads_Allocate */ RTEMS_INLINE_ROUTINE Thread_Control *_POSIX_Threads_Allocate( void ) { return (Thread_Control *) _Objects_Allocate( &_POSIX_Threads_Information ); 20061c0: 11 00 80 75 sethi %hi(0x201d400), %o0 20061c4: 40 00 08 a8 call 2008464 <_Objects_Allocate> 20061c8: 90 12 21 90 or %o0, 0x190, %o0 ! 201d590 <_POSIX_Threads_Information> * Allocate the thread control block. * * NOTE: Global threads are not currently supported. */ the_thread = _POSIX_Threads_Allocate(); if ( !the_thread ) { 20061cc: b8 92 20 00 orcc %o0, 0, %i4 20061d0: 32 80 00 04 bne,a 20061e0 20061d4: c2 06 60 08 ld [ %i1 + 8 ], %g1 _RTEMS_Unlock_allocator(); 20061d8: 10 80 00 21 b 200625c 20061dc: d0 04 e3 f4 ld [ %l3 + 0x3f4 ], %o0 static inline size_t _POSIX_Threads_Ensure_minimum_stack ( size_t size ) { if ( size >= PTHREAD_MINIMUM_STACK_SIZE ) 20061e0: 05 00 80 71 sethi %hi(0x201c400), %g2 20061e4: d6 00 a2 70 ld [ %g2 + 0x270 ], %o3 ! 201c670 /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 20061e8: 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 ) 20061ec: 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( 20061f0: 80 a2 c0 01 cmp %o3, %g1 20061f4: 1a 80 00 03 bcc 2006200 20061f8: d4 06 60 04 ld [ %i1 + 4 ], %o2 20061fc: 96 10 00 01 mov %g1, %o3 2006200: 82 10 20 01 mov 1, %g1 2006204: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2006208: c2 07 bf f8 ld [ %fp + -8 ], %g1 200620c: 9a 0c 60 ff and %l1, 0xff, %o5 2006210: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 2006214: c2 07 bf fc ld [ %fp + -4 ], %g1 2006218: c0 23 a0 68 clr [ %sp + 0x68 ] 200621c: c2 23 a0 64 st %g1, [ %sp + 0x64 ] 2006220: 82 07 bf d4 add %fp, -44, %g1 2006224: 23 00 80 75 sethi %hi(0x201d400), %l1 2006228: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 200622c: 90 14 61 90 or %l1, 0x190, %o0 2006230: 92 10 00 1c mov %i4, %o1 2006234: 98 10 20 01 mov 1, %o4 2006238: 40 00 0d 90 call 2009878 <_Thread_Initialize> 200623c: 9a 23 40 12 sub %o5, %l2, %o5 budget_callout, 0, /* isr level */ name /* posix threads don't have a name */ ); if ( !status ) { 2006240: 80 8a 20 ff btst 0xff, %o0 2006244: 12 80 00 0a bne 200626c 2006248: 90 14 61 90 or %l1, 0x190, %o0 RTEMS_INLINE_ROUTINE void _POSIX_Threads_Free ( Thread_Control *the_pthread ) { _Objects_Free( &_POSIX_Threads_Information, &the_pthread->Object ); 200624c: 40 00 09 5f call 20087c8 <_Objects_Free> 2006250: 92 10 00 1c mov %i4, %o1 _POSIX_Threads_Free( the_thread ); _RTEMS_Unlock_allocator(); 2006254: 03 00 80 74 sethi %hi(0x201d000), %g1 2006258: d0 00 63 f4 ld [ %g1 + 0x3f4 ], %o0 ! 201d3f4 <_RTEMS_Allocator_Mutex> 200625c: 40 00 05 f0 call 2007a1c <_API_Mutex_Unlock> 2006260: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2006264: 81 c7 e0 08 ret 2006268: 81 e8 00 00 restore } /* * finish initializing the per API structure */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200626c: e2 07 21 5c ld [ %i4 + 0x15c ], %l1 api->Attributes = *the_attr; 2006270: 92 10 00 19 mov %i1, %o1 2006274: 94 10 20 40 mov 0x40, %o2 2006278: 40 00 26 21 call 200fafc 200627c: 90 10 00 11 mov %l1, %o0 api->detachstate = the_attr->detachstate; 2006280: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 api->schedpolicy = schedpolicy; api->schedparam = schedparam; 2006284: 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; 2006288: c2 24 60 40 st %g1, [ %l1 + 0x40 ] api->schedpolicy = schedpolicy; api->schedparam = schedparam; 200628c: 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; 2006290: e0 24 60 84 st %l0, [ %l1 + 0x84 ] api->schedparam = schedparam; 2006294: 40 00 26 1a call 200fafc 2006298: 90 04 60 88 add %l1, 0x88, %o0 /* * POSIX threads are allocated and started in one operation. */ status = _Thread_Start( 200629c: 90 10 00 1c mov %i4, %o0 20062a0: 92 10 20 01 mov 1, %o1 20062a4: 94 10 00 1a mov %i2, %o2 20062a8: 96 10 00 1b mov %i3, %o3 20062ac: 40 00 0f c7 call 200a1c8 <_Thread_Start> 20062b0: 98 10 20 00 clr %o4 _RTEMS_Unlock_allocator(); return EINVAL; } #endif if ( schedpolicy == SCHED_SPORADIC ) { 20062b4: 80 a4 20 04 cmp %l0, 4 20062b8: 32 80 00 0a bne,a 20062e0 20062bc: c2 07 20 08 ld [ %i4 + 8 ], %g1 _Watchdog_Insert_ticks( 20062c0: 40 00 10 14 call 200a310 <_Timespec_To_ticks> 20062c4: 90 04 60 90 add %l1, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20062c8: 92 04 60 a8 add %l1, 0xa8, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20062cc: d0 24 60 b4 st %o0, [ %l1 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20062d0: 11 00 80 75 sethi %hi(0x201d400), %o0 20062d4: 40 00 10 e7 call 200a670 <_Watchdog_Insert> 20062d8: 90 12 20 0c or %o0, 0xc, %o0 ! 201d40c <_Watchdog_Ticks_chain> } /* * Return the id and indicate we successfully created the thread */ *thread = the_thread->Object.id; 20062dc: c2 07 20 08 ld [ %i4 + 8 ], %g1 20062e0: c2 27 40 00 st %g1, [ %i5 ] _RTEMS_Unlock_allocator(); 20062e4: 03 00 80 74 sethi %hi(0x201d000), %g1 20062e8: 40 00 05 cd call 2007a1c <_API_Mutex_Unlock> 20062ec: d0 00 63 f4 ld [ %g1 + 0x3f4 ], %o0 ! 201d3f4 <_RTEMS_Allocator_Mutex> return 0; 20062f0: 81 c7 e0 08 ret 20062f4: 81 e8 00 00 restore } 20062f8: 81 c7 e0 08 ret 20062fc: 81 e8 00 00 restore =============================================================================== 02019834 : int pthread_kill( pthread_t thread, int sig ) { 2019834: 9d e3 bf 98 save %sp, -104, %sp POSIX_API_Control *api; Thread_Control *the_thread; Objects_Locations location; if ( !sig ) 2019838: 80 a6 60 00 cmp %i1, 0 201983c: 02 80 00 06 be 2019854 2019840: 90 10 00 18 mov %i0, %o0 static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 2019844: b6 06 7f ff add %i1, -1, %i3 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 2019848: 80 a6 e0 1f cmp %i3, 0x1f 201984c: 08 80 00 08 bleu 201986c 2019850: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); 2019854: 7f ff d4 6c call 200ea04 <__errno> 2019858: b0 10 3f ff mov -1, %i0 ! ffffffff 201985c: 82 10 20 16 mov 0x16, %g1 2019860: c2 22 00 00 st %g1, [ %o0 ] 2019864: 81 c7 e0 08 ret 2019868: 81 e8 00 00 restore the_thread = _Thread_Get( thread, &location ); 201986c: 7f ff bd 26 call 2008d04 <_Thread_Get> 2019870: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2019874: c2 07 bf fc ld [ %fp + -4 ], %g1 2019878: 80 a0 60 00 cmp %g1, 0 201987c: 12 80 00 22 bne 2019904 <== NEVER TAKEN 2019880: 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 ) { 2019884: 85 2e 60 02 sll %i1, 2, %g2 2019888: 87 2e 60 04 sll %i1, 4, %g3 201988c: 86 20 c0 02 sub %g3, %g2, %g3 2019890: 05 00 80 73 sethi %hi(0x201cc00), %g2 2019894: 84 10 a3 50 or %g2, 0x350, %g2 ! 201cf50 <_POSIX_signals_Vectors> 2019898: 84 00 80 03 add %g2, %g3, %g2 201989c: c4 00 a0 08 ld [ %g2 + 8 ], %g2 20198a0: 80 a0 a0 01 cmp %g2, 1 20198a4: 02 80 00 14 be 20198f4 20198a8: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 20198ac: c4 00 60 d4 ld [ %g1 + 0xd4 ], %g2 static inline sigset_t signo_to_mask( uint32_t sig ) { return 1u << (sig - 1); 20198b0: ba 10 20 01 mov 1, %i5 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 20198b4: 92 10 00 19 mov %i1, %o1 20198b8: b7 2f 40 1b sll %i5, %i3, %i3 20198bc: 94 10 20 00 clr %o2 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 20198c0: b6 10 80 1b or %g2, %i3, %i3 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 20198c4: 7f ff ff 89 call 20196e8 <_POSIX_signals_Unblock_thread> 20198c8: f6 20 60 d4 st %i3, [ %g1 + 0xd4 ] if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 20198cc: 03 00 80 73 sethi %hi(0x201cc00), %g1 20198d0: 82 10 62 f8 or %g1, 0x2f8, %g1 ! 201cef8 <_Per_CPU_Information> 20198d4: c4 00 60 08 ld [ %g1 + 8 ], %g2 20198d8: 80 a0 a0 00 cmp %g2, 0 20198dc: 02 80 00 06 be 20198f4 20198e0: 01 00 00 00 nop 20198e4: c4 00 60 0c ld [ %g1 + 0xc ], %g2 20198e8: 80 a7 00 02 cmp %i4, %g2 20198ec: 22 80 00 02 be,a 20198f4 20198f0: fa 28 60 18 stb %i5, [ %g1 + 0x18 ] _Thread_Dispatch_necessary = true; } _Thread_Enable_dispatch(); 20198f4: 7f ff bc f7 call 2008cd0 <_Thread_Enable_dispatch> 20198f8: b0 10 20 00 clr %i0 return 0; 20198fc: 81 c7 e0 08 ret 2019900: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( ESRCH ); 2019904: 7f ff d4 40 call 200ea04 <__errno> <== NOT EXECUTED 2019908: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 201990c: 82 10 20 03 mov 3, %g1 <== NOT EXECUTED 2019910: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED } 2019914: 81 c7 e0 08 ret <== NOT EXECUTED 2019918: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 020081ac : int pthread_mutex_timedlock( pthread_mutex_t *mutex, const struct timespec *abstime ) { 20081ac: 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 ); 20081b0: 92 07 bf fc add %fp, -4, %o1 20081b4: 40 00 00 37 call 2008290 <_POSIX_Absolute_timeout_to_ticks> 20081b8: 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 ); 20081bc: 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, 20081c0: 82 1a 20 03 xor %o0, 3, %g1 20081c4: 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 ); 20081c8: 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 ); 20081cc: b8 60 3f ff subx %g0, -1, %i4 20081d0: 90 10 00 18 mov %i0, %o0 20081d4: 7f ff ff bd call 20080c8 <_POSIX_Mutex_Lock_support> 20081d8: 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) ) { 20081dc: 80 a7 20 00 cmp %i4, 0 20081e0: 12 80 00 0d bne 2008214 20081e4: b0 10 00 08 mov %o0, %i0 20081e8: 80 a2 20 10 cmp %o0, 0x10 20081ec: 12 80 00 0a bne 2008214 20081f0: 80 a7 60 00 cmp %i5, 0 if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 20081f4: 02 80 00 07 be 2008210 <== NEVER TAKEN 20081f8: ba 07 7f ff add %i5, -1, %i5 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 20081fc: 80 a7 60 01 cmp %i5, 1 2008200: 18 80 00 05 bgu 2008214 <== NEVER TAKEN 2008204: 01 00 00 00 nop status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; 2008208: 81 c7 e0 08 ret 200820c: 91 e8 20 74 restore %g0, 0x74, %o0 2008210: b0 10 20 16 mov 0x16, %i0 <== NOT EXECUTED } return lock_status; } 2008214: 81 c7 e0 08 ret 2008218: 81 e8 00 00 restore =============================================================================== 02005988 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_gettype( const pthread_mutexattr_t *attr, int *type ) { 2005988: 82 10 00 08 mov %o0, %g1 if ( !attr ) 200598c: 80 a0 60 00 cmp %g1, 0 2005990: 02 80 00 0b be 20059bc 2005994: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2005998: c4 00 40 00 ld [ %g1 ], %g2 200599c: 80 a0 a0 00 cmp %g2, 0 20059a0: 02 80 00 07 be 20059bc 20059a4: 80 a2 60 00 cmp %o1, 0 return EINVAL; if ( !type ) 20059a8: 02 80 00 05 be 20059bc <== NEVER TAKEN 20059ac: 01 00 00 00 nop return EINVAL; *type = attr->type; 20059b0: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 return 0; 20059b4: 90 10 20 00 clr %o0 return EINVAL; if ( !type ) return EINVAL; *type = attr->type; 20059b8: c2 22 40 00 st %g1, [ %o1 ] return 0; } 20059bc: 81 c3 e0 08 retl =============================================================================== 02007d9c : int pthread_mutexattr_setpshared( pthread_mutexattr_t *attr, int pshared ) { 2007d9c: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 2007da0: 80 a0 60 00 cmp %g1, 0 2007da4: 02 80 00 0a be 2007dcc 2007da8: 90 10 20 16 mov 0x16, %o0 2007dac: c4 00 40 00 ld [ %g1 ], %g2 2007db0: 80 a0 a0 00 cmp %g2, 0 2007db4: 02 80 00 06 be 2007dcc 2007db8: 80 a2 60 01 cmp %o1, 1 return EINVAL; switch ( pshared ) { 2007dbc: 18 80 00 04 bgu 2007dcc <== NEVER TAKEN 2007dc0: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 2007dc4: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; 2007dc8: 90 10 20 00 clr %o0 default: return EINVAL; } } 2007dcc: 81 c3 e0 08 retl =============================================================================== 020059f4 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_settype( pthread_mutexattr_t *attr, int type ) { 20059f4: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 20059f8: 80 a0 60 00 cmp %g1, 0 20059fc: 02 80 00 0a be 2005a24 2005a00: 90 10 20 16 mov 0x16, %o0 2005a04: c4 00 40 00 ld [ %g1 ], %g2 2005a08: 80 a0 a0 00 cmp %g2, 0 2005a0c: 02 80 00 06 be 2005a24 <== NEVER TAKEN 2005a10: 80 a2 60 03 cmp %o1, 3 return EINVAL; switch ( type ) { 2005a14: 18 80 00 04 bgu 2005a24 2005a18: 01 00 00 00 nop case PTHREAD_MUTEX_NORMAL: case PTHREAD_MUTEX_RECURSIVE: case PTHREAD_MUTEX_ERRORCHECK: case PTHREAD_MUTEX_DEFAULT: attr->type = type; 2005a1c: d2 20 60 10 st %o1, [ %g1 + 0x10 ] return 0; 2005a20: 90 10 20 00 clr %o0 default: return EINVAL; } } 2005a24: 81 c3 e0 08 retl =============================================================================== 020066d4 : int pthread_once( pthread_once_t *once_control, void (*init_routine)(void) ) { 20066d4: 9d e3 bf 98 save %sp, -104, %sp if ( !once_control || !init_routine ) 20066d8: 80 a6 60 00 cmp %i1, 0 20066dc: 02 80 00 1c be 200674c 20066e0: ba 10 00 18 mov %i0, %i5 20066e4: 80 a6 20 00 cmp %i0, 0 20066e8: 22 80 00 17 be,a 2006744 20066ec: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !once_control->init_executed ) { 20066f0: c2 06 20 04 ld [ %i0 + 4 ], %g1 20066f4: 80 a0 60 00 cmp %g1, 0 20066f8: 12 80 00 13 bne 2006744 20066fc: b0 10 20 00 clr %i0 rtems_mode saveMode; rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode); 2006700: 90 10 21 00 mov 0x100, %o0 2006704: 92 10 21 00 mov 0x100, %o1 2006708: 40 00 03 06 call 2007320 200670c: 94 07 bf fc add %fp, -4, %o2 if ( !once_control->init_executed ) { 2006710: c2 07 60 04 ld [ %i5 + 4 ], %g1 2006714: 80 a0 60 00 cmp %g1, 0 2006718: 12 80 00 07 bne 2006734 <== NEVER TAKEN 200671c: d0 07 bf fc ld [ %fp + -4 ], %o0 once_control->is_initialized = true; 2006720: 82 10 20 01 mov 1, %g1 2006724: c2 27 40 00 st %g1, [ %i5 ] once_control->init_executed = true; (*init_routine)(); 2006728: 9f c6 40 00 call %i1 200672c: c2 27 60 04 st %g1, [ %i5 + 4 ] } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); 2006730: d0 07 bf fc ld [ %fp + -4 ], %o0 2006734: 92 10 21 00 mov 0x100, %o1 2006738: 94 07 bf fc add %fp, -4, %o2 200673c: 40 00 02 f9 call 2007320 2006740: b0 10 20 00 clr %i0 2006744: 81 c7 e0 08 ret 2006748: 81 e8 00 00 restore pthread_once_t *once_control, void (*init_routine)(void) ) { if ( !once_control || !init_routine ) return EINVAL; 200674c: b0 10 20 16 mov 0x16, %i0 (*init_routine)(); } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); } return 0; } 2006750: 81 c7 e0 08 ret 2006754: 81 e8 00 00 restore =============================================================================== 020070a8 : int pthread_rwlock_init( pthread_rwlock_t *rwlock, const pthread_rwlockattr_t *attr ) { 20070a8: 9d e3 bf 90 save %sp, -112, %sp 20070ac: ba 10 00 18 mov %i0, %i5 const pthread_rwlockattr_t *the_attr; /* * Error check parameters */ if ( !rwlock ) 20070b0: 80 a7 60 00 cmp %i5, 0 20070b4: 02 80 00 1d be 2007128 20070b8: b0 10 20 16 mov 0x16, %i0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 20070bc: 80 a6 60 00 cmp %i1, 0 20070c0: 32 80 00 06 bne,a 20070d8 20070c4: c2 06 40 00 ld [ %i1 ], %g1 the_attr = attr; } else { (void) pthread_rwlockattr_init( &default_attr ); 20070c8: 90 07 bf f4 add %fp, -12, %o0 20070cc: 40 00 02 6c call 2007a7c 20070d0: 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 ) 20070d4: c2 06 40 00 ld [ %i1 ], %g1 20070d8: 80 a0 60 00 cmp %g1, 0 20070dc: 02 80 00 13 be 2007128 <== NEVER TAKEN 20070e0: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 20070e4: c2 06 60 04 ld [ %i1 + 4 ], %g1 20070e8: 80 a0 60 00 cmp %g1, 0 20070ec: 12 80 00 0f bne 2007128 <== NEVER TAKEN 20070f0: 03 00 80 66 sethi %hi(0x2019800), %g1 * * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 20070f4: c4 00 63 70 ld [ %g1 + 0x370 ], %g2 ! 2019b70 <_Thread_Dispatch_disable_level> */ RTEMS_INLINE_ROUTINE void _CORE_RWLock_Initialize_attributes( CORE_RWLock_Attributes *the_attributes ) { the_attributes->XXX = 0; 20070f8: c0 27 bf fc clr [ %fp + -4 ] 20070fc: 84 00 a0 01 inc %g2 2007100: c4 20 63 70 st %g2, [ %g1 + 0x370 ] return _Thread_Dispatch_disable_level; 2007104: c2 00 63 70 ld [ %g1 + 0x370 ], %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 *) 2007108: 37 00 80 67 sethi %hi(0x2019c00), %i3 200710c: 40 00 09 e7 call 20098a8 <_Objects_Allocate> 2007110: 90 16 e1 70 or %i3, 0x170, %o0 ! 2019d70 <_POSIX_RWLock_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_rwlock = _POSIX_RWLock_Allocate(); if ( !the_rwlock ) { 2007114: b8 92 20 00 orcc %o0, 0, %i4 2007118: 12 80 00 06 bne 2007130 200711c: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); 2007120: 40 00 0e ae call 200abd8 <_Thread_Enable_dispatch> 2007124: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2007128: 81 c7 e0 08 ret 200712c: 81 e8 00 00 restore } _CORE_RWLock_Initialize( &the_rwlock->RWLock, &the_attributes ); 2007130: 40 00 07 8d call 2008f64 <_CORE_RWLock_Initialize> 2007134: 92 07 bf fc add %fp, -4, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007138: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 *rwlock = the_rwlock->Object.id; _Thread_Enable_dispatch(); return 0; } 200713c: b6 16 e1 70 or %i3, 0x170, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007140: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007144: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007148: 85 28 a0 02 sll %g2, 2, %g2 200714c: 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; 2007150: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_RWLock_Information, &the_rwlock->Object, 0 ); *rwlock = the_rwlock->Object.id; 2007154: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2007158: 40 00 0e a0 call 200abd8 <_Thread_Enable_dispatch> 200715c: b0 10 20 00 clr %i0 return 0; } 2007160: 81 c7 e0 08 ret 2007164: 81 e8 00 00 restore =============================================================================== 020071d8 : int pthread_rwlock_timedrdlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 20071d8: 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; 20071dc: 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 ) 20071e0: 80 a6 20 00 cmp %i0, 0 20071e4: 02 80 00 2b be 2007290 20071e8: 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 ); 20071ec: 40 00 1a ce call 200dd24 <_POSIX_Absolute_timeout_to_ticks> 20071f0: 92 07 bf fc add %fp, -4, %o1 20071f4: d2 06 00 00 ld [ %i0 ], %o1 20071f8: b8 10 00 08 mov %o0, %i4 20071fc: 94 07 bf f8 add %fp, -8, %o2 2007200: 11 00 80 67 sethi %hi(0x2019c00), %o0 2007204: 40 00 0a e4 call 2009d94 <_Objects_Get> 2007208: 90 12 21 70 or %o0, 0x170, %o0 ! 2019d70 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 200720c: c2 07 bf f8 ld [ %fp + -8 ], %g1 2007210: 80 a0 60 00 cmp %g1, 0 2007214: 12 80 00 1f bne 2007290 2007218: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_reading( 200721c: 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, 2007220: 82 1f 20 03 xor %i4, 3, %g1 2007224: 90 02 20 10 add %o0, 0x10, %o0 2007228: 80 a0 00 01 cmp %g0, %g1 200722c: 98 10 20 00 clr %o4 2007230: b6 60 3f ff subx %g0, -1, %i3 2007234: 40 00 07 56 call 2008f8c <_CORE_RWLock_Obtain_for_reading> 2007238: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 200723c: 40 00 0e 67 call 200abd8 <_Thread_Enable_dispatch> 2007240: 01 00 00 00 nop if ( !do_wait ) { 2007244: 80 a6 e0 00 cmp %i3, 0 2007248: 12 80 00 0d bne 200727c 200724c: 03 00 80 68 sethi %hi(0x201a000), %g1 if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 2007250: c2 00 60 b4 ld [ %g1 + 0xb4 ], %g1 ! 201a0b4 <_Per_CPU_Information+0xc> 2007254: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2007258: 80 a0 60 02 cmp %g1, 2 200725c: 32 80 00 09 bne,a 2007280 2007260: 03 00 80 68 sethi %hi(0x201a000), %g1 if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 2007264: 80 a7 20 00 cmp %i4, 0 2007268: 02 80 00 0a be 2007290 <== NEVER TAKEN 200726c: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2007270: 80 a7 20 01 cmp %i4, 1 2007274: 08 80 00 07 bleu 2007290 <== ALWAYS TAKEN 2007278: 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 200727c: 03 00 80 68 sethi %hi(0x201a000), %g1 2007280: c2 00 60 b4 ld [ %g1 + 0xb4 ], %g1 ! 201a0b4 <_Per_CPU_Information+0xc> status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } } return _POSIX_RWLock_Translate_core_RWLock_return_code( 2007284: 40 00 00 35 call 2007358 <_POSIX_RWLock_Translate_core_RWLock_return_code> 2007288: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 200728c: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 2007290: 81 c7 e0 08 ret 2007294: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02007298 : int pthread_rwlock_timedwrlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 2007298: 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; 200729c: 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 ) 20072a0: 80 a6 20 00 cmp %i0, 0 20072a4: 02 80 00 2b be 2007350 20072a8: 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 ); 20072ac: 40 00 1a 9e call 200dd24 <_POSIX_Absolute_timeout_to_ticks> 20072b0: 92 07 bf fc add %fp, -4, %o1 20072b4: d2 06 00 00 ld [ %i0 ], %o1 20072b8: b8 10 00 08 mov %o0, %i4 20072bc: 94 07 bf f8 add %fp, -8, %o2 20072c0: 11 00 80 67 sethi %hi(0x2019c00), %o0 20072c4: 40 00 0a b4 call 2009d94 <_Objects_Get> 20072c8: 90 12 21 70 or %o0, 0x170, %o0 ! 2019d70 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 20072cc: c2 07 bf f8 ld [ %fp + -8 ], %g1 20072d0: 80 a0 60 00 cmp %g1, 0 20072d4: 12 80 00 1f bne 2007350 20072d8: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_writing( 20072dc: 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, 20072e0: 82 1f 20 03 xor %i4, 3, %g1 20072e4: 90 02 20 10 add %o0, 0x10, %o0 20072e8: 80 a0 00 01 cmp %g0, %g1 20072ec: 98 10 20 00 clr %o4 20072f0: b6 60 3f ff subx %g0, -1, %i3 20072f4: 40 00 07 5a call 200905c <_CORE_RWLock_Obtain_for_writing> 20072f8: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 20072fc: 40 00 0e 37 call 200abd8 <_Thread_Enable_dispatch> 2007300: 01 00 00 00 nop if ( !do_wait && 2007304: 80 a6 e0 00 cmp %i3, 0 2007308: 12 80 00 0d bne 200733c 200730c: 03 00 80 68 sethi %hi(0x201a000), %g1 (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { 2007310: c2 00 60 b4 ld [ %g1 + 0xb4 ], %g1 ! 201a0b4 <_Per_CPU_Information+0xc> ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait && 2007314: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2007318: 80 a0 60 02 cmp %g1, 2 200731c: 32 80 00 09 bne,a 2007340 2007320: 03 00 80 68 sethi %hi(0x201a000), %g1 (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 2007324: 80 a7 20 00 cmp %i4, 0 2007328: 02 80 00 0a be 2007350 <== NEVER TAKEN 200732c: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 2007330: 80 a7 20 01 cmp %i4, 1 2007334: 08 80 00 07 bleu 2007350 <== ALWAYS TAKEN 2007338: 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 200733c: 03 00 80 68 sethi %hi(0x201a000), %g1 2007340: c2 00 60 b4 ld [ %g1 + 0xb4 ], %g1 ! 201a0b4 <_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( 2007344: 40 00 00 05 call 2007358 <_POSIX_RWLock_Translate_core_RWLock_return_code> 2007348: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 200734c: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 2007350: 81 c7 e0 08 ret 2007354: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02007aa4 : int pthread_rwlockattr_setpshared( pthread_rwlockattr_t *attr, int pshared ) { 2007aa4: 82 10 00 08 mov %o0, %g1 if ( !attr ) 2007aa8: 80 a0 60 00 cmp %g1, 0 2007aac: 02 80 00 0a be 2007ad4 2007ab0: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2007ab4: c4 00 40 00 ld [ %g1 ], %g2 2007ab8: 80 a0 a0 00 cmp %g2, 0 2007abc: 02 80 00 06 be 2007ad4 2007ac0: 80 a2 60 01 cmp %o1, 1 return EINVAL; switch ( pshared ) { 2007ac4: 18 80 00 04 bgu 2007ad4 <== NEVER TAKEN 2007ac8: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 2007acc: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; 2007ad0: 90 10 20 00 clr %o0 default: return EINVAL; } } 2007ad4: 81 c3 e0 08 retl =============================================================================== 020089c8 : int pthread_setschedparam( pthread_t thread, int policy, struct sched_param *param ) { 20089c8: 9d e3 bf 90 save %sp, -112, %sp 20089cc: ba 10 00 18 mov %i0, %i5 int rc; /* * Check all the parameters */ if ( !param ) 20089d0: 80 a6 a0 00 cmp %i2, 0 20089d4: 02 80 00 3d be 2008ac8 20089d8: b0 10 20 16 mov 0x16, %i0 return EINVAL; rc = _POSIX_Thread_Translate_sched_param( 20089dc: 90 10 00 19 mov %i1, %o0 20089e0: 92 10 00 1a mov %i2, %o1 20089e4: 94 07 bf f4 add %fp, -12, %o2 20089e8: 40 00 18 87 call 200ec04 <_POSIX_Thread_Translate_sched_param> 20089ec: 96 07 bf f8 add %fp, -8, %o3 policy, param, &budget_algorithm, &budget_callout ); if ( rc ) 20089f0: b0 92 20 00 orcc %o0, 0, %i0 20089f4: 12 80 00 35 bne 2008ac8 20089f8: 90 10 00 1d mov %i5, %o0 return rc; /* * Actually change the scheduling policy and parameters */ the_thread = _Thread_Get( thread, &location ); 20089fc: 40 00 0b da call 200b964 <_Thread_Get> 2008a00: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2008a04: c2 07 bf fc ld [ %fp + -4 ], %g1 2008a08: 80 a0 60 00 cmp %g1, 0 2008a0c: 12 80 00 31 bne 2008ad0 2008a10: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 2008a14: fa 02 21 5c ld [ %o0 + 0x15c ], %i5 if ( api->schedpolicy == SCHED_SPORADIC ) 2008a18: c2 07 60 84 ld [ %i5 + 0x84 ], %g1 2008a1c: 80 a0 60 04 cmp %g1, 4 2008a20: 32 80 00 05 bne,a 2008a34 2008a24: f2 27 60 84 st %i1, [ %i5 + 0x84 ] (void) _Watchdog_Remove( &api->Sporadic_timer ); 2008a28: 40 00 10 06 call 200ca40 <_Watchdog_Remove> 2008a2c: 90 07 60 a8 add %i5, 0xa8, %o0 api->schedpolicy = policy; 2008a30: f2 27 60 84 st %i1, [ %i5 + 0x84 ] api->schedparam = *param; 2008a34: 90 07 60 88 add %i5, 0x88, %o0 2008a38: 92 10 00 1a mov %i2, %o1 2008a3c: 40 00 25 1d call 2011eb0 2008a40: 94 10 20 1c mov 0x1c, %o2 the_thread->budget_algorithm = budget_algorithm; 2008a44: c2 07 bf f4 ld [ %fp + -12 ], %g1 the_thread->budget_callout = budget_callout; switch ( api->schedpolicy ) { 2008a48: 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; 2008a4c: c2 27 20 7c st %g1, [ %i4 + 0x7c ] the_thread->budget_callout = budget_callout; 2008a50: c2 07 bf f8 ld [ %fp + -8 ], %g1 switch ( api->schedpolicy ) { 2008a54: 06 80 00 1b bl 2008ac0 <== NEVER TAKEN 2008a58: c2 27 20 80 st %g1, [ %i4 + 0x80 ] 2008a5c: 80 a6 60 02 cmp %i1, 2 2008a60: 04 80 00 07 ble 2008a7c 2008a64: 03 00 80 6c sethi %hi(0x201b000), %g1 2008a68: 80 a6 60 04 cmp %i1, 4 2008a6c: 12 80 00 15 bne 2008ac0 <== NEVER TAKEN 2008a70: 01 00 00 00 nop true ); break; case SCHED_SPORADIC: api->ss_high_priority = api->schedparam.sched_priority; 2008a74: 10 80 00 0d b 2008aa8 2008a78: 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; 2008a7c: c2 00 61 44 ld [ %g1 + 0x144 ], %g1 the_thread->real_priority = _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 2008a80: 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; 2008a84: c2 27 20 78 st %g1, [ %i4 + 0x78 ] 2008a88: 03 00 80 69 sethi %hi(0x201a400), %g1 2008a8c: d2 08 60 8c ldub [ %g1 + 0x8c ], %o1 ! 201a48c 2008a90: c2 07 60 88 ld [ %i5 + 0x88 ], %g1 the_thread->real_priority = _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 2008a94: 94 10 20 01 mov 1, %o2 2008a98: 92 22 40 01 sub %o1, %g1, %o1 2008a9c: 40 00 0a 81 call 200b4a0 <_Thread_Change_priority> 2008aa0: d2 27 20 18 st %o1, [ %i4 + 0x18 ] the_thread, the_thread->real_priority, true ); break; 2008aa4: 30 80 00 07 b,a 2008ac0 case SCHED_SPORADIC: api->ss_high_priority = api->schedparam.sched_priority; _Watchdog_Remove( &api->Sporadic_timer ); 2008aa8: 90 07 60 a8 add %i5, 0xa8, %o0 2008aac: 40 00 0f e5 call 200ca40 <_Watchdog_Remove> 2008ab0: c2 27 60 a4 st %g1, [ %i5 + 0xa4 ] _POSIX_Threads_Sporadic_budget_TSR( 0, the_thread ); 2008ab4: 90 10 20 00 clr %o0 2008ab8: 7f ff ff 80 call 20088b8 <_POSIX_Threads_Sporadic_budget_TSR> 2008abc: 92 10 00 1c mov %i4, %o1 break; } _Thread_Enable_dispatch(); 2008ac0: 40 00 0b 9c call 200b930 <_Thread_Enable_dispatch> 2008ac4: 01 00 00 00 nop return 0; 2008ac8: 81 c7 e0 08 ret 2008acc: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } return ESRCH; 2008ad0: b0 10 20 03 mov 3, %i0 } 2008ad4: 81 c7 e0 08 ret 2008ad8: 81 e8 00 00 restore =============================================================================== 020063f0 : /* * 18.2.2 Setting Cancelability State, P1003.1c/Draft 10, p. 183 */ void pthread_testcancel( void ) { 20063f0: 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() ) 20063f4: 03 00 80 5f sethi %hi(0x2017c00), %g1 20063f8: 82 10 62 b8 or %g1, 0x2b8, %g1 ! 2017eb8 <_Per_CPU_Information> 20063fc: c4 00 60 08 ld [ %g1 + 8 ], %g2 2006400: 80 a0 a0 00 cmp %g2, 0 2006404: 12 80 00 19 bne 2006468 <== NEVER TAKEN 2006408: 01 00 00 00 nop return; thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 200640c: c2 00 60 0c ld [ %g1 + 0xc ], %g1 2006410: 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++; 2006414: 03 00 80 5e sethi %hi(0x2017800), %g1 2006418: c6 00 61 80 ld [ %g1 + 0x180 ], %g3 ! 2017980 <_Thread_Dispatch_disable_level> 200641c: 86 00 e0 01 inc %g3 2006420: c6 20 61 80 st %g3, [ %g1 + 0x180 ] return _Thread_Dispatch_disable_level; 2006424: c2 00 61 80 ld [ %g1 + 0x180 ], %g1 _Thread_Disable_dispatch(); if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 2006428: c2 00 a0 d8 ld [ %g2 + 0xd8 ], %g1 200642c: 80 a0 60 00 cmp %g1, 0 2006430: 12 80 00 05 bne 2006444 <== NEVER TAKEN 2006434: 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)); 2006438: c2 00 a0 e0 ld [ %g2 + 0xe0 ], %g1 200643c: 80 a0 00 01 cmp %g0, %g1 2006440: ba 40 20 00 addx %g0, 0, %i5 thread_support->cancelation_requested ) cancel = true; _Thread_Enable_dispatch(); 2006444: 40 00 0b 70 call 2009204 <_Thread_Enable_dispatch> 2006448: 01 00 00 00 nop if ( cancel ) 200644c: 80 8f 60 ff btst 0xff, %i5 2006450: 02 80 00 06 be 2006468 2006454: 01 00 00 00 nop _POSIX_Thread_Exit( _Thread_Executing, PTHREAD_CANCELED ); 2006458: 03 00 80 5f sethi %hi(0x2017c00), %g1 200645c: f0 00 62 c4 ld [ %g1 + 0x2c4 ], %i0 ! 2017ec4 <_Per_CPU_Information+0xc> 2006460: 40 00 18 67 call 200c5fc <_POSIX_Thread_Exit> 2006464: 93 e8 3f ff restore %g0, -1, %o1 2006468: 81 c7 e0 08 ret 200646c: 81 e8 00 00 restore =============================================================================== 02006f74 : * errno - otherwise */ int rtems_aio_enqueue (rtems_aio_request *req) { 2006f74: 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); 2006f78: 3b 00 80 62 sethi %hi(0x2018800), %i5 2006f7c: 40 00 02 77 call 2007958 2006f80: 90 17 62 3c or %i5, 0x23c, %o0 ! 2018a3c if (result != 0) { 2006f84: b8 92 20 00 orcc %o0, 0, %i4 2006f88: 02 80 00 06 be 2006fa0 <== ALWAYS TAKEN 2006f8c: 01 00 00 00 nop free (req); 2006f90: 7f ff f1 72 call 2003558 <== NOT EXECUTED 2006f94: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED return result; 2006f98: 81 c7 e0 08 ret <== NOT EXECUTED 2006f9c: 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); 2006fa0: 40 00 04 73 call 200816c 2006fa4: ba 17 62 3c or %i5, 0x23c, %i5 2006fa8: 92 07 bf fc add %fp, -4, %o1 2006fac: 40 00 03 7c call 2007d9c 2006fb0: 94 07 bf dc add %fp, -36, %o2 req->caller_thread = pthread_self (); 2006fb4: 40 00 04 6e call 200816c 2006fb8: 01 00 00 00 nop req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2006fbc: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2006fc0: c6 07 bf dc ld [ %fp + -36 ], %g3 2006fc4: 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 (); 2006fc8: d0 26 20 10 st %o0, [ %i0 + 0x10 ] req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2006fcc: 84 20 c0 02 sub %g3, %g2, %g2 2006fd0: c4 26 20 0c st %g2, [ %i0 + 0xc ] req->policy = policy; 2006fd4: c4 07 bf fc ld [ %fp + -4 ], %g2 2006fd8: c4 26 20 08 st %g2, [ %i0 + 8 ] req->aiocbp->error_code = EINPROGRESS; 2006fdc: 84 10 20 77 mov 0x77, %g2 2006fe0: c4 20 60 34 st %g2, [ %g1 + 0x34 ] req->aiocbp->return_value = 0; if ((aio_request_queue.idle_threads == 0) && 2006fe4: 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; 2006fe8: c0 20 60 38 clr [ %g1 + 0x38 ] if ((aio_request_queue.idle_threads == 0) && 2006fec: 80 a0 a0 00 cmp %g2, 0 2006ff0: 12 80 00 33 bne 20070bc <== NEVER TAKEN 2006ff4: d2 00 40 00 ld [ %g1 ], %o1 2006ff8: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 2006ffc: 80 a0 60 04 cmp %g1, 4 2007000: 14 80 00 30 bg 20070c0 2007004: 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); 2007008: 90 07 60 48 add %i5, 0x48, %o0 200700c: 7f ff fe c4 call 2006b1c 2007010: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2007014: 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); 2007018: b6 10 00 08 mov %o0, %i3 if (r_chain->new_fd == 1) { 200701c: 80 a0 60 01 cmp %g1, 1 2007020: 12 80 00 1d bne 2007094 2007024: 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); 2007028: 90 10 00 1a mov %i2, %o0 200702c: 40 00 08 d2 call 2009374 <_Chain_Insert> 2007030: 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); 2007034: 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; 2007038: c0 26 e0 18 clr [ %i3 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 200703c: 40 00 01 f1 call 2007800 2007040: 92 10 20 00 clr %o1 pthread_cond_init (&r_chain->cond, NULL); 2007044: 90 06 e0 20 add %i3, 0x20, %o0 2007048: 40 00 00 fa call 2007430 200704c: 92 10 20 00 clr %o1 AIO_printf ("New thread \n"); result = pthread_create (&thid, &aio_request_queue.attr, 2007050: 96 10 00 1b mov %i3, %o3 2007054: 90 07 bf f8 add %fp, -8, %o0 2007058: 92 07 60 08 add %i5, 8, %o1 200705c: 15 00 80 1b sethi %hi(0x2006c00), %o2 2007060: 40 00 02 bf call 2007b5c 2007064: 94 12 a0 08 or %o2, 8, %o2 ! 2006c08 rtems_aio_handle, (void *) r_chain); if (result != 0) { 2007068: b6 92 20 00 orcc %o0, 0, %i3 200706c: 22 80 00 07 be,a 2007088 <== ALWAYS TAKEN 2007070: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 pthread_mutex_unlock (&aio_request_queue.mutex); 2007074: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2007078: 40 00 02 58 call 20079d8 <== NOT EXECUTED 200707c: b8 10 00 1b mov %i3, %i4 <== NOT EXECUTED return result; 2007080: 81 c7 e0 08 ret <== NOT EXECUTED 2007084: 91 e8 00 1c restore %g0, %i4, %o0 <== NOT EXECUTED } ++aio_request_queue.active_threads; 2007088: 82 00 60 01 inc %g1 200708c: 10 80 00 40 b 200718c 2007090: c2 27 60 64 st %g1, [ %i5 + 0x64 ] } else { /* put request in the fd chain it belongs to */ pthread_mutex_lock (&r_chain->mutex); 2007094: ba 02 20 1c add %o0, 0x1c, %i5 2007098: 40 00 02 30 call 2007958 200709c: 90 10 00 1d mov %i5, %o0 rtems_aio_insert_prio (&r_chain->perfd, req); 20070a0: 90 10 00 1a mov %i2, %o0 20070a4: 7f ff ff 6d call 2006e58 20070a8: 92 10 00 18 mov %i0, %o1 pthread_cond_signal (&r_chain->cond); 20070ac: 40 00 01 10 call 20074ec 20070b0: 90 06 e0 20 add %i3, 0x20, %o0 pthread_mutex_unlock (&r_chain->mutex); 20070b4: 10 80 00 11 b 20070f8 20070b8: 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, 20070bc: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 20070c0: 94 10 20 00 clr %o2 20070c4: 7f ff fe 96 call 2006b1c 20070c8: 90 12 22 84 or %o0, 0x284, %o0 req->aiocbp->aio_fildes, 0); if (r_chain != NULL) 20070cc: ba 92 20 00 orcc %o0, 0, %i5 20070d0: 02 80 00 0e be 2007108 20070d4: b6 07 60 1c add %i5, 0x1c, %i3 { pthread_mutex_lock (&r_chain->mutex); 20070d8: 40 00 02 20 call 2007958 20070dc: 90 10 00 1b mov %i3, %o0 rtems_aio_insert_prio (&r_chain->perfd, req); 20070e0: 90 07 60 08 add %i5, 8, %o0 20070e4: 7f ff ff 5d call 2006e58 20070e8: 92 10 00 18 mov %i0, %o1 pthread_cond_signal (&r_chain->cond); 20070ec: 40 00 01 00 call 20074ec 20070f0: 90 07 60 20 add %i5, 0x20, %o0 pthread_mutex_unlock (&r_chain->mutex); 20070f4: 90 10 00 1b mov %i3, %o0 20070f8: 40 00 02 38 call 20079d8 20070fc: 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); 2007100: 10 80 00 24 b 2007190 2007104: 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); 2007108: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 200710c: 11 00 80 62 sethi %hi(0x2018800), %o0 2007110: d2 00 40 00 ld [ %g1 ], %o1 2007114: 90 12 22 90 or %o0, 0x290, %o0 2007118: 7f ff fe 81 call 2006b1c 200711c: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2007120: 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); 2007124: ba 10 00 08 mov %o0, %i5 2007128: 92 10 00 18 mov %i0, %o1 if (r_chain->new_fd == 1) { 200712c: 80 a0 60 01 cmp %g1, 1 2007130: 12 80 00 0d bne 2007164 2007134: 90 02 20 08 add %o0, 8, %o0 2007138: 40 00 08 8f call 2009374 <_Chain_Insert> 200713c: 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); 2007140: 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; 2007144: c0 27 60 18 clr [ %i5 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 2007148: 40 00 01 ae call 2007800 200714c: 92 10 20 00 clr %o1 pthread_cond_init (&r_chain->cond, NULL); 2007150: 90 07 60 20 add %i5, 0x20, %o0 2007154: 40 00 00 b7 call 2007430 2007158: 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) 200715c: 10 80 00 05 b 2007170 2007160: 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); 2007164: 7f ff ff 3d call 2006e58 2007168: 01 00 00 00 nop if (aio_request_queue.idle_threads > 0) 200716c: 11 00 80 62 sethi %hi(0x2018800), %o0 2007170: 90 12 22 3c or %o0, 0x23c, %o0 ! 2018a3c 2007174: c2 02 20 68 ld [ %o0 + 0x68 ], %g1 2007178: 80 a0 60 00 cmp %g1, 0 200717c: 24 80 00 05 ble,a 2007190 <== ALWAYS TAKEN 2007180: 11 00 80 62 sethi %hi(0x2018800), %o0 pthread_cond_signal (&aio_request_queue.new_req); 2007184: 40 00 00 da call 20074ec <== NOT EXECUTED 2007188: 90 02 20 04 add %o0, 4, %o0 ! 2018804 <== NOT EXECUTED } } pthread_mutex_unlock (&aio_request_queue.mutex); 200718c: 11 00 80 62 sethi %hi(0x2018800), %o0 2007190: 40 00 02 12 call 20079d8 2007194: 90 12 22 3c or %o0, 0x23c, %o0 ! 2018a3c return 0; } 2007198: b0 10 00 1c mov %i4, %i0 200719c: 81 c7 e0 08 ret 20071a0: 81 e8 00 00 restore =============================================================================== 02006c08 : * NULL - if error */ static void * rtems_aio_handle (void *arg) { 2006c08: 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); 2006c0c: 3b 00 80 62 sethi %hi(0x2018800), %i5 default: result = -1; } if (result == -1) { req->aiocbp->return_value = -1; 2006c10: 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); 2006c14: ba 17 62 3c or %i5, 0x23c, %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)) { 2006c18: 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, 2006c1c: 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); 2006c20: a0 06 20 1c add %i0, 0x1c, %l0 2006c24: 40 00 03 4d call 2007958 2006c28: 90 10 00 10 mov %l0, %o0 if (result != 0) 2006c2c: 80 a2 20 00 cmp %o0, 0 2006c30: 12 80 00 87 bne 2006e4c <== NEVER TAKEN 2006c34: 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; 2006c38: 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)) { 2006c3c: 80 a7 00 01 cmp %i4, %g1 2006c40: 02 80 00 3a be 2006d28 2006c44: 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); 2006c48: 40 00 05 49 call 200816c 2006c4c: 01 00 00 00 nop 2006c50: 92 07 bf fc add %fp, -4, %o1 2006c54: 40 00 04 52 call 2007d9c 2006c58: 94 07 bf d8 add %fp, -40, %o2 param.sched_priority = req->priority; 2006c5c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 pthread_setschedparam (pthread_self(), req->policy, ¶m); 2006c60: 40 00 05 43 call 200816c 2006c64: c2 27 bf d8 st %g1, [ %fp + -40 ] 2006c68: d2 07 20 08 ld [ %i4 + 8 ], %o1 2006c6c: 40 00 05 44 call 200817c 2006c70: 94 07 bf d8 add %fp, -40, %o2 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2006c74: 40 00 09 a8 call 2009314 <_Chain_Extract> 2006c78: 90 10 00 1c mov %i4, %o0 rtems_chain_extract (node); pthread_mutex_unlock (&r_chain->mutex); 2006c7c: 40 00 03 57 call 20079d8 2006c80: 90 10 00 10 mov %l0, %o0 switch (req->aiocbp->aio_lio_opcode) { 2006c84: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 2006c88: c4 00 60 30 ld [ %g1 + 0x30 ], %g2 2006c8c: 80 a0 a0 02 cmp %g2, 2 2006c90: 22 80 00 10 be,a 2006cd0 2006c94: c4 18 60 08 ldd [ %g1 + 8 ], %g2 2006c98: 80 a0 a0 03 cmp %g2, 3 2006c9c: 02 80 00 15 be 2006cf0 <== NEVER TAKEN 2006ca0: 80 a0 a0 01 cmp %g2, 1 2006ca4: 32 80 00 19 bne,a 2006d08 <== NEVER TAKEN 2006ca8: f8 07 20 14 ld [ %i4 + 0x14 ], %i4 <== NOT EXECUTED case LIO_READ: AIO_printf ("read\n"); result = pread (req->aiocbp->aio_fildes, 2006cac: c4 18 60 08 ldd [ %g1 + 8 ], %g2 2006cb0: d0 00 40 00 ld [ %g1 ], %o0 2006cb4: d2 00 60 10 ld [ %g1 + 0x10 ], %o1 2006cb8: d4 00 60 14 ld [ %g1 + 0x14 ], %o2 2006cbc: 96 10 00 02 mov %g2, %o3 2006cc0: 40 00 2b ac call 2011b70 2006cc4: 98 10 00 03 mov %g3, %o4 (void *) req->aiocbp->aio_buf, req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; 2006cc8: 10 80 00 0d b 2006cfc 2006ccc: 80 a2 3f ff cmp %o0, -1 case LIO_WRITE: AIO_printf ("write\n"); result = pwrite (req->aiocbp->aio_fildes, 2006cd0: d0 00 40 00 ld [ %g1 ], %o0 2006cd4: d2 00 60 10 ld [ %g1 + 0x10 ], %o1 2006cd8: d4 00 60 14 ld [ %g1 + 0x14 ], %o2 2006cdc: 96 10 00 02 mov %g2, %o3 2006ce0: 40 00 2b e2 call 2011c68 2006ce4: 98 10 00 03 mov %g3, %o4 (void *) req->aiocbp->aio_buf, req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; 2006ce8: 10 80 00 05 b 2006cfc 2006cec: 80 a2 3f ff cmp %o0, -1 case LIO_SYNC: AIO_printf ("sync\n"); result = fsync (req->aiocbp->aio_fildes); 2006cf0: 40 00 1b c3 call 200dbfc <== NOT EXECUTED 2006cf4: d0 00 40 00 ld [ %g1 ], %o0 <== NOT EXECUTED break; default: result = -1; } if (result == -1) { 2006cf8: 80 a2 3f ff cmp %o0, -1 <== NOT EXECUTED 2006cfc: 32 80 00 08 bne,a 2006d1c <== ALWAYS TAKEN 2006d00: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 req->aiocbp->return_value = -1; 2006d04: f8 07 20 14 ld [ %i4 + 0x14 ], %i4 <== NOT EXECUTED req->aiocbp->error_code = errno; 2006d08: 40 00 28 77 call 2010ee4 <__errno> <== NOT EXECUTED 2006d0c: f6 27 20 38 st %i3, [ %i4 + 0x38 ] <== NOT EXECUTED 2006d10: c2 02 00 00 ld [ %o0 ], %g1 <== NOT EXECUTED 2006d14: 10 bf ff c3 b 2006c20 <== NOT EXECUTED 2006d18: c2 27 20 34 st %g1, [ %i4 + 0x34 ] <== NOT EXECUTED } else { req->aiocbp->return_value = result; 2006d1c: d0 20 60 38 st %o0, [ %g1 + 0x38 ] req->aiocbp->error_code = 0; 2006d20: 10 bf ff c0 b 2006c20 2006d24: 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); 2006d28: 40 00 03 2c call 20079d8 2006d2c: 90 10 00 10 mov %l0, %o0 pthread_mutex_lock (&aio_request_queue.mutex); 2006d30: 40 00 03 0a call 2007958 2006d34: 90 10 00 1d mov %i5, %o0 if (rtems_chain_is_empty (chain)) 2006d38: c2 06 20 08 ld [ %i0 + 8 ], %g1 2006d3c: 80 a0 40 1c cmp %g1, %i4 2006d40: 12 80 00 3f bne 2006e3c <== NEVER TAKEN 2006d44: 92 07 bf f4 add %fp, -12, %o1 { clock_gettime (CLOCK_REALTIME, &timeout); 2006d48: 40 00 01 62 call 20072d0 2006d4c: 90 10 20 01 mov 1, %o0 timeout.tv_sec += 3; 2006d50: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 2006d54: 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; 2006d58: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 2006d5c: 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; 2006d60: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 2006d64: 90 10 00 1c mov %i4, %o0 2006d68: 92 10 00 1d mov %i5, %o1 2006d6c: 40 00 01 fd call 2007560 2006d70: 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) { 2006d74: 80 a2 20 74 cmp %o0, 0x74 2006d78: 12 80 00 31 bne 2006e3c <== NEVER TAKEN 2006d7c: 01 00 00 00 nop 2006d80: 40 00 09 65 call 2009314 <_Chain_Extract> 2006d84: 90 10 00 18 mov %i0, %o0 rtems_chain_extract (&r_chain->next_fd); pthread_mutex_destroy (&r_chain->mutex); 2006d88: 40 00 02 4f call 20076c4 2006d8c: 90 10 00 10 mov %l0, %o0 pthread_cond_destroy (&r_chain->cond); 2006d90: 40 00 01 74 call 2007360 2006d94: 90 10 00 1c mov %i4, %o0 free (r_chain); 2006d98: 7f ff f1 f0 call 2003558 2006d9c: 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)) { 2006da0: c2 07 60 54 ld [ %i5 + 0x54 ], %g1 2006da4: 80 a0 40 19 cmp %g1, %i1 2006da8: 12 80 00 1b bne 2006e14 2006dac: 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); 2006db0: 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; 2006db4: 82 00 60 01 inc %g1 2006db8: c2 27 60 68 st %g1, [ %i5 + 0x68 ] --aio_request_queue.active_threads; 2006dbc: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 clock_gettime (CLOCK_REALTIME, &timeout); 2006dc0: 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; 2006dc4: 82 00 7f ff add %g1, -1, %g1 clock_gettime (CLOCK_REALTIME, &timeout); 2006dc8: 40 00 01 42 call 20072d0 2006dcc: c2 27 60 64 st %g1, [ %i5 + 0x64 ] timeout.tv_sec += 3; 2006dd0: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 2006dd4: 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; 2006dd8: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 2006ddc: 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; 2006de0: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 2006de4: 92 10 00 1d mov %i5, %o1 2006de8: 40 00 01 de call 2007560 2006dec: 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) { 2006df0: 80 a2 20 74 cmp %o0, 0x74 2006df4: 12 80 00 08 bne 2006e14 <== NEVER TAKEN 2006df8: c2 07 60 68 ld [ %i5 + 0x68 ], %g1 AIO_printf ("Etimeout\n"); --aio_request_queue.idle_threads; pthread_mutex_unlock (&aio_request_queue.mutex); 2006dfc: 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; 2006e00: 82 00 7f ff add %g1, -1, %g1 pthread_mutex_unlock (&aio_request_queue.mutex); 2006e04: 40 00 02 f5 call 20079d8 2006e08: c2 27 60 68 st %g1, [ %i5 + 0x68 ] return NULL; 2006e0c: 81 c7 e0 08 ret 2006e10: 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; 2006e14: 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; 2006e18: 82 00 7f ff add %g1, -1, %g1 2006e1c: c2 27 60 68 st %g1, [ %i5 + 0x68 ] ++aio_request_queue.active_threads; 2006e20: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 2006e24: 90 10 00 18 mov %i0, %o0 2006e28: 82 00 60 01 inc %g1 2006e2c: 40 00 09 3a call 2009314 <_Chain_Extract> 2006e30: 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); 2006e34: 7f ff ff 65 call 2006bc8 2006e38: 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); 2006e3c: 40 00 02 e7 call 20079d8 2006e40: 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); 2006e44: 10 bf ff 78 b 2006c24 2006e48: a0 06 20 1c add %i0, 0x1c, %l0 } } AIO_printf ("Thread finished\n"); return NULL; } 2006e4c: b0 10 20 00 clr %i0 <== NOT EXECUTED 2006e50: 81 c7 e0 08 ret <== NOT EXECUTED 2006e54: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02006a3c : * 0 - if initialization succeeded */ int rtems_aio_init (void) { 2006a3c: 9d e3 bf a0 save %sp, -96, %sp int result = 0; result = pthread_attr_init (&aio_request_queue.attr); 2006a40: 3b 00 80 62 sethi %hi(0x2018800), %i5 2006a44: 40 00 04 2c call 2007af4 2006a48: 90 17 62 44 or %i5, 0x244, %o0 ! 2018a44 if (result != 0) 2006a4c: b0 92 20 00 orcc %o0, 0, %i0 2006a50: 12 80 00 31 bne 2006b14 <== NEVER TAKEN 2006a54: 90 17 62 44 or %i5, 0x244, %o0 return result; result = 2006a58: 40 00 04 33 call 2007b24 2006a5c: 92 10 20 00 clr %o1 pthread_attr_setdetachstate (&aio_request_queue.attr, PTHREAD_CREATE_DETACHED); if (result != 0) 2006a60: 80 a2 20 00 cmp %o0, 0 2006a64: 22 80 00 05 be,a 2006a78 <== ALWAYS TAKEN 2006a68: 11 00 80 62 sethi %hi(0x2018800), %o0 pthread_attr_destroy (&aio_request_queue.attr); 2006a6c: 40 00 04 16 call 2007ac4 <== NOT EXECUTED 2006a70: 90 17 62 44 or %i5, 0x244, %o0 <== NOT EXECUTED result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 2006a74: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 2006a78: 92 10 20 00 clr %o1 2006a7c: 40 00 03 61 call 2007800 2006a80: 90 12 22 3c or %o0, 0x23c, %o0 if (result != 0) 2006a84: 80 a2 20 00 cmp %o0, 0 2006a88: 22 80 00 06 be,a 2006aa0 <== ALWAYS TAKEN 2006a8c: 11 00 80 62 sethi %hi(0x2018800), %o0 pthread_attr_destroy (&aio_request_queue.attr); 2006a90: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 2006a94: 40 00 04 0c call 2007ac4 <== NOT EXECUTED 2006a98: 90 12 22 44 or %o0, 0x244, %o0 ! 2018a44 <== NOT EXECUTED result = pthread_cond_init (&aio_request_queue.new_req, NULL); 2006a9c: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 2006aa0: 92 10 20 00 clr %o1 2006aa4: 40 00 02 63 call 2007430 2006aa8: 90 12 22 40 or %o0, 0x240, %o0 if (result != 0) { 2006aac: b0 92 20 00 orcc %o0, 0, %i0 2006ab0: 02 80 00 09 be 2006ad4 <== ALWAYS TAKEN 2006ab4: 03 00 80 62 sethi %hi(0x2018800), %g1 pthread_mutex_destroy (&aio_request_queue.mutex); 2006ab8: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 2006abc: 40 00 03 02 call 20076c4 <== NOT EXECUTED 2006ac0: 90 12 22 3c or %o0, 0x23c, %o0 ! 2018a3c <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 2006ac4: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 2006ac8: 40 00 03 ff call 2007ac4 <== NOT EXECUTED 2006acc: 90 12 22 44 or %o0, 0x244, %o0 ! 2018a44 <== NOT EXECUTED ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2006ad0: 03 00 80 62 sethi %hi(0x2018800), %g1 <== NOT EXECUTED 2006ad4: 82 10 62 3c or %g1, 0x23c, %g1 ! 2018a3c 2006ad8: 84 00 60 4c add %g1, 0x4c, %g2 2006adc: c4 20 60 48 st %g2, [ %g1 + 0x48 ] head->previous = NULL; tail->previous = head; 2006ae0: 84 00 60 48 add %g1, 0x48, %g2 2006ae4: 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; 2006ae8: 84 00 60 58 add %g1, 0x58, %g2 2006aec: c4 20 60 54 st %g2, [ %g1 + 0x54 ] head->previous = NULL; tail->previous = head; 2006af0: 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; 2006af4: c0 20 60 4c clr [ %g1 + 0x4c ] tail->previous = head; 2006af8: 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; 2006afc: 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; 2006b00: 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; 2006b04: c0 20 60 64 clr [ %g1 + 0x64 ] aio_request_queue.idle_threads = 0; aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 2006b08: 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; 2006b0c: c0 20 60 68 clr [ %g1 + 0x68 ] aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 2006b10: c4 20 60 60 st %g2, [ %g1 + 0x60 ] return result; } 2006b14: 81 c7 e0 08 ret 2006b18: 81 e8 00 00 restore =============================================================================== 02006e58 : * NONE */ void rtems_aio_insert_prio (rtems_chain_control *chain, rtems_aio_request *req) { 2006e58: 9d e3 bf a0 save %sp, -96, %sp 2006e5c: 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 ); 2006e60: 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)) { 2006e64: 80 a0 40 03 cmp %g1, %g3 2006e68: 02 80 00 10 be 2006ea8 <== NEVER TAKEN 2006e6c: 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; 2006e70: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 while (req->aiocbp->aio_reqprio > prio && 2006e74: 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; 2006e78: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 while (req->aiocbp->aio_reqprio > prio && 2006e7c: 10 80 00 04 b 2006e8c 2006e80: 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; 2006e84: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 <== NOT EXECUTED 2006e88: 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 && 2006e8c: 80 a3 c0 04 cmp %o7, %g4 2006e90: 04 80 00 04 ble 2006ea0 <== ALWAYS TAKEN 2006e94: 80 a0 40 03 cmp %g1, %g3 2006e98: 32 bf ff fb bne,a 2006e84 <== NOT EXECUTED 2006e9c: 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 ); 2006ea0: f0 00 60 04 ld [ %g1 + 4 ], %i0 2006ea4: b2 10 00 02 mov %g2, %i1 2006ea8: 40 00 09 33 call 2009374 <_Chain_Insert> 2006eac: 81 e8 00 00 restore =============================================================================== 02006bc8 : */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2006bc8: 05 00 80 62 sethi %hi(0x2018800), %g2 * NONE */ void rtems_aio_move_to_work (rtems_aio_request_chain *r_chain) { 2006bcc: 92 10 00 08 mov %o0, %o1 2006bd0: 84 10 a2 3c or %g2, 0x23c, %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 && 2006bd4: 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; 2006bd8: c2 00 a0 48 ld [ %g2 + 0x48 ], %g1 2006bdc: 84 00 a0 4c add %g2, 0x4c, %g2 while (temp->fildes < r_chain->fildes && 2006be0: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 2006be4: 80 a1 00 03 cmp %g4, %g3 2006be8: 16 80 00 04 bge 2006bf8 2006bec: 80 a0 40 02 cmp %g1, %g2 2006bf0: 32 bf ff fc bne,a 2006be0 <== ALWAYS TAKEN 2006bf4: c2 00 40 00 ld [ %g1 ], %g1 2006bf8: d0 00 60 04 ld [ %g1 + 4 ], %o0 2006bfc: 82 13 c0 00 mov %o7, %g1 2006c00: 40 00 09 dd call 2009374 <_Chain_Insert> 2006c04: 9e 10 40 00 mov %g1, %o7 =============================================================================== 02006f00 : * 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) { 2006f00: 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; 2006f04: 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 ); 2006f08: 82 06 20 04 add %i0, 4, %g1 if (rtems_chain_is_empty (chain)) 2006f0c: 80 a7 40 01 cmp %i5, %g1 2006f10: 12 80 00 05 bne 2006f24 2006f14: b0 10 20 02 mov 2, %i0 2006f18: 81 c7 e0 08 ret 2006f1c: 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) { 2006f20: 80 a7 40 01 cmp %i5, %g1 <== NOT EXECUTED 2006f24: 02 80 00 12 be 2006f6c <== NEVER TAKEN 2006f28: 01 00 00 00 nop 2006f2c: c4 07 60 14 ld [ %i5 + 0x14 ], %g2 2006f30: 80 a0 80 19 cmp %g2, %i1 2006f34: 32 bf ff fb bne,a 2006f20 <== NEVER TAKEN 2006f38: fa 07 40 00 ld [ %i5 ], %i5 <== NOT EXECUTED 2006f3c: 40 00 08 f6 call 2009314 <_Chain_Extract> 2006f40: 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; 2006f44: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2006f48: 84 10 20 8c mov 0x8c, %g2 2006f4c: c4 20 60 34 st %g2, [ %g1 + 0x34 ] current->aiocbp->return_value = -1; 2006f50: 84 10 3f ff mov -1, %g2 free (current); 2006f54: 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; 2006f58: c4 20 60 38 st %g2, [ %g1 + 0x38 ] free (current); 2006f5c: 7f ff f1 7f call 2003558 2006f60: b0 10 20 00 clr %i0 } return AIO_CANCELED; 2006f64: 81 c7 e0 08 ret 2006f68: 81 e8 00 00 restore } 2006f6c: 81 c7 e0 08 ret <== NOT EXECUTED 2006f70: 91 e8 20 01 restore %g0, 1, %o0 <== NOT EXECUTED =============================================================================== 02006cf0 : rtems_chain_control *chain, rtems_event_set events, rtems_interval timeout, rtems_chain_node **node_ptr ) { 2006cf0: 9d e3 bf 98 save %sp, -104, %sp 2006cf4: 10 80 00 09 b 2006d18 2006cf8: 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( 2006cfc: 92 10 20 00 clr %o1 2006d00: 94 10 00 1a mov %i2, %o2 2006d04: 7f ff fd 03 call 2006110 2006d08: 96 07 bf fc add %fp, -4, %o3 ) { rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( 2006d0c: 80 a2 20 00 cmp %o0, 0 2006d10: 32 80 00 09 bne,a 2006d34 <== ALWAYS TAKEN 2006d14: 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 ); 2006d18: 40 00 01 7e call 2007310 <_Chain_Get> 2006d1c: 90 10 00 1d mov %i5, %o0 sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL 2006d20: b8 92 20 00 orcc %o0, 0, %i4 2006d24: 02 bf ff f6 be 2006cfc 2006d28: 90 10 00 19 mov %i1, %o0 2006d2c: 90 10 20 00 clr %o0 timeout, &out ); } *node_ptr = node; 2006d30: f8 26 c0 00 st %i4, [ %i3 ] return sc; } 2006d34: 81 c7 e0 08 ret 2006d38: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02009048 : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 2009048: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 200904c: 80 a6 20 00 cmp %i0, 0 2009050: 02 80 00 1b be 20090bc <== NEVER TAKEN 2009054: 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 ]; 2009058: 35 00 80 7d sethi %hi(0x201f400), %i2 #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 200905c: 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 ]; 2009060: 84 16 a0 68 or %i2, 0x68, %g2 2009064: c2 00 80 01 ld [ %g2 + %g1 ], %g1 2009068: f6 00 60 04 ld [ %g1 + 4 ], %i3 if ( !information ) 200906c: 80 a6 e0 00 cmp %i3, 0 2009070: 12 80 00 0b bne 200909c 2009074: b8 10 20 01 mov 1, %i4 Objects_Information *information; if ( !routine ) return; for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) { 2009078: 10 80 00 0e b 20090b0 200907c: 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 ]; 2009080: 83 2f 20 02 sll %i4, 2, %g1 2009084: d0 00 80 01 ld [ %g2 + %g1 ], %o0 if ( !the_thread ) 2009088: 80 a2 20 00 cmp %o0, 0 200908c: 02 80 00 04 be 200909c 2009090: b8 07 20 01 inc %i4 continue; (*routine)(the_thread); 2009094: 9f c6 00 00 call %i0 2009098: 01 00 00 00 nop information = _Objects_Information_table[ api_index ][ 1 ]; if ( !information ) continue; for ( i=1 ; i <= information->maximum ; i++ ) { 200909c: c2 16 e0 10 lduh [ %i3 + 0x10 ], %g1 20090a0: 80 a7 00 01 cmp %i4, %g1 20090a4: 28 bf ff f7 bleu,a 2009080 20090a8: 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++ ) { 20090ac: ba 07 60 01 inc %i5 20090b0: 80 a7 60 04 cmp %i5, 4 20090b4: 12 bf ff eb bne 2009060 20090b8: 83 2f 60 02 sll %i5, 2, %g1 20090bc: 81 c7 e0 08 ret 20090c0: 81 e8 00 00 restore =============================================================================== 02014b3c : uint32_t length, uint32_t buffer_size, rtems_attribute attribute_set, rtems_id *id ) { 2014b3c: 9d e3 bf a0 save %sp, -96, %sp register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) 2014b40: 80 a6 20 00 cmp %i0, 0 2014b44: 02 80 00 39 be 2014c28 2014b48: 82 10 20 03 mov 3, %g1 return RTEMS_INVALID_NAME; if ( !starting_address ) 2014b4c: 80 a6 60 00 cmp %i1, 0 2014b50: 02 80 00 36 be 2014c28 2014b54: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !id ) 2014b58: 80 a7 60 00 cmp %i5, 0 2014b5c: 02 80 00 33 be 2014c28 <== NEVER TAKEN 2014b60: 80 a6 e0 00 cmp %i3, 0 return RTEMS_INVALID_ADDRESS; if ( length == 0 || buffer_size == 0 || length < buffer_size || 2014b64: 02 80 00 31 be 2014c28 2014b68: 82 10 20 08 mov 8, %g1 2014b6c: 80 a6 a0 00 cmp %i2, 0 2014b70: 02 80 00 2e be 2014c28 2014b74: 80 a6 80 1b cmp %i2, %i3 2014b78: 0a 80 00 2c bcs 2014c28 2014b7c: 80 8e e0 07 btst 7, %i3 2014b80: 12 80 00 2a bne 2014c28 2014b84: 80 8e 60 07 btst 7, %i1 !_Partition_Is_buffer_size_aligned( buffer_size ) ) return RTEMS_INVALID_SIZE; if ( !_Addresses_Is_aligned( starting_address ) ) 2014b88: 12 80 00 28 bne 2014c28 2014b8c: 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++; 2014b90: 03 00 80 ed sethi %hi(0x203b400), %g1 2014b94: c4 00 62 30 ld [ %g1 + 0x230 ], %g2 ! 203b630 <_Thread_Dispatch_disable_level> 2014b98: 84 00 a0 01 inc %g2 2014b9c: c4 20 62 30 st %g2, [ %g1 + 0x230 ] return _Thread_Dispatch_disable_level; 2014ba0: c2 00 62 30 ld [ %g1 + 0x230 ], %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 ); 2014ba4: 23 00 80 ed sethi %hi(0x203b400), %l1 2014ba8: 40 00 12 77 call 2019584 <_Objects_Allocate> 2014bac: 90 14 60 44 or %l1, 0x44, %o0 ! 203b444 <_Partition_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { 2014bb0: a0 92 20 00 orcc %o0, 0, %l0 2014bb4: 32 80 00 06 bne,a 2014bcc 2014bb8: f8 24 20 1c st %i4, [ %l0 + 0x1c ] _Thread_Enable_dispatch(); 2014bbc: 40 00 17 79 call 201a9a0 <_Thread_Enable_dispatch> 2014bc0: 01 00 00 00 nop return RTEMS_TOO_MANY; 2014bc4: 10 80 00 19 b 2014c28 2014bc8: 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 ); 2014bcc: 92 10 00 1b mov %i3, %o1 _Thread_Enable_dispatch(); return RTEMS_TOO_MANY; } #endif the_partition->starting_address = starting_address; 2014bd0: f2 24 20 10 st %i1, [ %l0 + 0x10 ] the_partition->length = length; 2014bd4: f4 24 20 14 st %i2, [ %l0 + 0x14 ] the_partition->buffer_size = buffer_size; 2014bd8: f6 24 20 18 st %i3, [ %l0 + 0x18 ] the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; 2014bdc: c0 24 20 20 clr [ %l0 + 0x20 ] _Chain_Initialize( &the_partition->Memory, starting_address, length / buffer_size, buffer_size ); 2014be0: 40 00 58 c0 call 202aee0 <.udiv> 2014be4: 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, 2014be8: 92 10 00 19 mov %i1, %o1 length / buffer_size, buffer_size ); 2014bec: 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, 2014bf0: 96 10 00 1b mov %i3, %o3 2014bf4: b8 04 20 24 add %l0, 0x24, %i4 2014bf8: 40 00 0c 6a call 2017da0 <_Chain_Initialize> 2014bfc: 90 10 00 1c mov %i4, %o0 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2014c00: c4 14 20 0a lduh [ %l0 + 0xa ], %g2 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 2014c04: a2 14 60 44 or %l1, 0x44, %l1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2014c08: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2014c0c: c2 04 20 08 ld [ %l0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2014c10: 85 28 a0 02 sll %g2, 2, %g2 2014c14: e0 20 c0 02 st %l0, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2014c18: f0 24 20 0c st %i0, [ %l0 + 0xc ] name, 0 /* Not used */ ); #endif _Thread_Enable_dispatch(); 2014c1c: 40 00 17 61 call 201a9a0 <_Thread_Enable_dispatch> 2014c20: c2 27 40 00 st %g1, [ %i5 ] return RTEMS_SUCCESSFUL; 2014c24: 82 10 20 00 clr %g1 } 2014c28: 81 c7 e0 08 ret 2014c2c: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 02007228 : rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 2007228: 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 *) 200722c: 11 00 80 79 sethi %hi(0x201e400), %o0 2007230: 92 10 00 18 mov %i0, %o1 2007234: 90 12 23 04 or %o0, 0x304, %o0 2007238: 40 00 08 ff call 2009634 <_Objects_Get> 200723c: 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 ) { 2007240: c2 07 bf fc ld [ %fp + -4 ], %g1 2007244: 80 a0 60 00 cmp %g1, 0 2007248: 12 80 00 65 bne 20073dc 200724c: ba 10 00 08 mov %o0, %i5 RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 2007250: 37 00 80 7b sethi %hi(0x201ec00), %i3 case OBJECTS_LOCAL: if ( !_Thread_Is_executing( the_period->owner ) ) { 2007254: c4 02 20 40 ld [ %o0 + 0x40 ], %g2 2007258: b6 16 e1 a8 or %i3, 0x1a8, %i3 200725c: c2 06 e0 0c ld [ %i3 + 0xc ], %g1 2007260: 80 a0 80 01 cmp %g2, %g1 2007264: 02 80 00 06 be 200727c 2007268: 80 a6 60 00 cmp %i1, 0 _Thread_Enable_dispatch(); 200726c: 40 00 0c ae call 200a524 <_Thread_Enable_dispatch> 2007270: b0 10 20 17 mov 0x17, %i0 return RTEMS_NOT_OWNER_OF_RESOURCE; 2007274: 81 c7 e0 08 ret 2007278: 81 e8 00 00 restore } if ( length == RTEMS_PERIOD_STATUS ) { 200727c: 12 80 00 0d bne 20072b0 2007280: 01 00 00 00 nop switch ( the_period->state ) { 2007284: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2007288: 80 a0 60 04 cmp %g1, 4 200728c: 18 80 00 05 bgu 20072a0 <== NEVER TAKEN 2007290: b0 10 20 00 clr %i0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2007294: 05 00 80 71 sethi %hi(0x201c400), %g2 2007298: 84 10 a1 08 or %g2, 0x108, %g2 ! 201c508 200729c: 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(); 20072a0: 40 00 0c a1 call 200a524 <_Thread_Enable_dispatch> 20072a4: 01 00 00 00 nop return( return_value ); 20072a8: 81 c7 e0 08 ret 20072ac: 81 e8 00 00 restore } _ISR_Disable( level ); 20072b0: 7f ff ee fb call 2002e9c 20072b4: 01 00 00 00 nop 20072b8: b4 10 00 08 mov %o0, %i2 if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { 20072bc: f8 07 60 38 ld [ %i5 + 0x38 ], %i4 20072c0: 80 a7 20 00 cmp %i4, 0 20072c4: 12 80 00 15 bne 2007318 20072c8: 80 a7 20 02 cmp %i4, 2 _ISR_Enable( level ); 20072cc: 7f ff ee f8 call 2002eac 20072d0: 01 00 00 00 nop /* * Baseline statistics information for the beginning of a period. */ _Rate_monotonic_Initiate_statistics( the_period ); 20072d4: 7f ff ff 7f call 20070d0 <_Rate_monotonic_Initiate_statistics> 20072d8: 90 10 00 1d mov %i5, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 20072dc: 82 10 20 02 mov 2, %g1 20072e0: c2 27 60 38 st %g1, [ %i5 + 0x38 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 20072e4: 03 00 80 1d sethi %hi(0x2007400), %g1 20072e8: 82 10 62 98 or %g1, 0x298, %g1 ! 2007698 <_Rate_monotonic_Timeout> Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 20072ec: c0 27 60 18 clr [ %i5 + 0x18 ] the_watchdog->routine = routine; 20072f0: c2 27 60 2c st %g1, [ %i5 + 0x2c ] the_watchdog->id = id; 20072f4: f0 27 60 30 st %i0, [ %i5 + 0x30 ] the_watchdog->user_data = user_data; 20072f8: c0 27 60 34 clr [ %i5 + 0x34 ] _Rate_monotonic_Timeout, id, NULL ); the_period->next_length = length; 20072fc: f2 27 60 3c st %i1, [ %i5 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2007300: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007304: 11 00 80 7a sethi %hi(0x201e800), %o0 2007308: 92 07 60 10 add %i5, 0x10, %o1 200730c: 40 00 10 5e call 200b484 <_Watchdog_Insert> 2007310: 90 12 21 2c or %o0, 0x12c, %o0 2007314: 30 80 00 1b b,a 2007380 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { 2007318: 12 80 00 1e bne 2007390 200731c: 80 a7 20 04 cmp %i4, 4 /* * Update statistics from the concluding period. */ _Rate_monotonic_Update_statistics( the_period ); 2007320: 7f ff ff 86 call 2007138 <_Rate_monotonic_Update_statistics> 2007324: 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; 2007328: 82 10 20 01 mov 1, %g1 the_period->next_length = length; 200732c: 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; 2007330: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; _ISR_Enable( level ); 2007334: 7f ff ee de call 2002eac 2007338: 90 10 00 1a mov %i2, %o0 _Thread_Executing->Wait.id = the_period->Object.id; 200733c: d0 06 e0 0c ld [ %i3 + 0xc ], %o0 2007340: c2 07 60 08 ld [ %i5 + 8 ], %g1 _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 2007344: 13 00 00 10 sethi %hi(0x4000), %o1 2007348: 40 00 0e a6 call 200ade0 <_Thread_Set_state> 200734c: c2 22 20 20 st %g1, [ %o0 + 0x20 ] /* * Did the watchdog timer expire while we were actually blocking * on it? */ _ISR_Disable( level ); 2007350: 7f ff ee d3 call 2002e9c 2007354: 01 00 00 00 nop local_state = the_period->state; 2007358: f4 07 60 38 ld [ %i5 + 0x38 ], %i2 the_period->state = RATE_MONOTONIC_ACTIVE; 200735c: f8 27 60 38 st %i4, [ %i5 + 0x38 ] _ISR_Enable( level ); 2007360: 7f ff ee d3 call 2002eac 2007364: 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 ) 2007368: 80 a6 a0 03 cmp %i2, 3 200736c: 12 80 00 05 bne 2007380 2007370: 01 00 00 00 nop _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 2007374: d0 06 e0 0c ld [ %i3 + 0xc ], %o0 2007378: 40 00 0b 8d call 200a1ac <_Thread_Clear_state> 200737c: 13 00 00 10 sethi %hi(0x4000), %o1 _Thread_Enable_dispatch(); 2007380: 40 00 0c 69 call 200a524 <_Thread_Enable_dispatch> 2007384: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2007388: 81 c7 e0 08 ret 200738c: 81 e8 00 00 restore } if ( the_period->state == RATE_MONOTONIC_EXPIRED ) { 2007390: 12 bf ff b9 bne 2007274 <== NEVER TAKEN 2007394: b0 10 20 04 mov 4, %i0 /* * Update statistics from the concluding period */ _Rate_monotonic_Update_statistics( the_period ); 2007398: 7f ff ff 68 call 2007138 <_Rate_monotonic_Update_statistics> 200739c: 90 10 00 1d mov %i5, %o0 _ISR_Enable( level ); 20073a0: 7f ff ee c3 call 2002eac 20073a4: 90 10 00 1a mov %i2, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 20073a8: 82 10 20 02 mov 2, %g1 20073ac: 92 07 60 10 add %i5, 0x10, %o1 20073b0: 11 00 80 7a sethi %hi(0x201e800), %o0 20073b4: 90 12 21 2c or %o0, 0x12c, %o0 ! 201e92c <_Watchdog_Ticks_chain> 20073b8: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; 20073bc: f2 27 60 3c st %i1, [ %i5 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20073c0: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20073c4: 40 00 10 30 call 200b484 <_Watchdog_Insert> 20073c8: b0 10 20 06 mov 6, %i0 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 20073cc: 40 00 0c 56 call 200a524 <_Thread_Enable_dispatch> 20073d0: 01 00 00 00 nop return RTEMS_TIMEOUT; 20073d4: 81 c7 e0 08 ret 20073d8: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 20073dc: b0 10 20 04 mov 4, %i0 } 20073e0: 81 c7 e0 08 ret 20073e4: 81 e8 00 00 restore =============================================================================== 020073e8 : */ void rtems_rate_monotonic_report_statistics_with_plugin( void *context, rtems_printk_plugin_t print ) { 20073e8: 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 ) 20073ec: 80 a6 60 00 cmp %i1, 0 20073f0: 02 80 00 75 be 20075c4 <== NEVER TAKEN 20073f4: 90 10 00 18 mov %i0, %o0 return; (*print)( context, "Period information by period\n" ); 20073f8: 13 00 80 71 sethi %hi(0x201c400), %o1 20073fc: 9f c6 40 00 call %i1 2007400: 92 12 61 10 or %o1, 0x110, %o1 ! 201c510 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ (*print)( context, "--- CPU times are in seconds ---\n" ); 2007404: 90 10 00 18 mov %i0, %o0 2007408: 13 00 80 71 sethi %hi(0x201c400), %o1 200740c: 9f c6 40 00 call %i1 2007410: 92 12 61 30 or %o1, 0x130, %o1 ! 201c530 (*print)( context, "--- Wall times are in seconds ---\n" ); 2007414: 90 10 00 18 mov %i0, %o0 2007418: 13 00 80 71 sethi %hi(0x201c400), %o1 200741c: 9f c6 40 00 call %i1 2007420: 92 12 61 58 or %o1, 0x158, %o1 ! 201c558 Be sure to test the various cases. (*print)( context,"\ 1234567890123456789012345678901234567890123456789012345678901234567890123456789\ \n"); */ (*print)( context, " ID OWNER COUNT MISSED " 2007424: 90 10 00 18 mov %i0, %o0 2007428: 13 00 80 71 sethi %hi(0x201c400), %o1 200742c: 9f c6 40 00 call %i1 2007430: 92 12 61 80 or %o1, 0x180, %o1 ! 201c580 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ " " #endif " WALL TIME\n" ); (*print)( context, " " 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 61 d0 or %o1, 0x1d0, %o1 ! 201c5d0 /* * 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 ; 2007444: 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, 2007448: 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, 200744c: 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, 2007450: 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" ); 2007454: 39 00 80 6d sethi %hi(0x201b400), %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 ; 2007458: fa 00 63 0c ld [ %g1 + 0x30c ], %i5 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 200745c: a0 14 22 20 or %l0, 0x220, %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, 2007460: b4 16 a2 38 or %i2, 0x238, %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, 2007464: b6 16 e2 58 or %i3, 0x258, %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 ; 2007468: 10 80 00 52 b 20075b0 200746c: b8 17 23 98 or %i4, 0x398, %i4 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 2007470: 40 00 19 ce call 200dba8 2007474: 92 07 bf a0 add %fp, -96, %o1 if ( status != RTEMS_SUCCESSFUL ) 2007478: 80 a2 20 00 cmp %o0, 0 200747c: 32 80 00 4d bne,a 20075b0 2007480: 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 ); 2007484: 92 07 bf d8 add %fp, -40, %o1 2007488: 40 00 19 f5 call 200dc5c 200748c: 90 10 00 1d mov %i5, %o0 #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 2007490: d0 07 bf d8 ld [ %fp + -40 ], %o0 2007494: 92 10 20 05 mov 5, %o1 2007498: 40 00 00 af call 2007754 200749c: 94 07 bf f8 add %fp, -8, %o2 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 20074a0: d8 1f bf a0 ldd [ %fp + -96 ], %o4 20074a4: 92 10 00 10 mov %l0, %o1 20074a8: 90 10 00 18 mov %i0, %o0 20074ac: 94 10 00 1d mov %i5, %o2 20074b0: 9f c6 40 00 call %i1 20074b4: 96 07 bf f8 add %fp, -8, %o3 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 20074b8: d2 07 bf a0 ld [ %fp + -96 ], %o1 20074bc: 80 a2 60 00 cmp %o1, 0 20074c0: 12 80 00 07 bne 20074dc 20074c4: 94 07 bf f0 add %fp, -16, %o2 (*print)( context, "\n" ); 20074c8: 90 10 00 18 mov %i0, %o0 20074cc: 9f c6 40 00 call %i1 20074d0: 92 10 00 1c mov %i4, %o1 continue; 20074d4: 10 80 00 37 b 20075b0 20074d8: 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 ); 20074dc: 40 00 0e cb call 200b008 <_Timespec_Divide_by_integer> 20074e0: 90 07 bf b8 add %fp, -72, %o0 (*print)( context, 20074e4: d0 07 bf ac ld [ %fp + -84 ], %o0 20074e8: 40 00 47 27 call 2019184 <.div> 20074ec: 92 10 23 e8 mov 0x3e8, %o1 20074f0: a6 10 00 08 mov %o0, %l3 20074f4: d0 07 bf b4 ld [ %fp + -76 ], %o0 20074f8: 40 00 47 23 call 2019184 <.div> 20074fc: 92 10 23 e8 mov 0x3e8, %o1 2007500: c2 07 bf f0 ld [ %fp + -16 ], %g1 2007504: a2 10 00 08 mov %o0, %l1 2007508: d0 07 bf f4 ld [ %fp + -12 ], %o0 200750c: e8 07 bf a8 ld [ %fp + -88 ], %l4 2007510: e4 07 bf b0 ld [ %fp + -80 ], %l2 2007514: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2007518: 40 00 47 1b call 2019184 <.div> 200751c: 92 10 23 e8 mov 0x3e8, %o1 2007520: 96 10 00 13 mov %l3, %o3 2007524: 98 10 00 12 mov %l2, %o4 2007528: 9a 10 00 11 mov %l1, %o5 200752c: 94 10 00 14 mov %l4, %o2 2007530: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 2007534: 92 10 00 1a mov %i2, %o1 2007538: 9f c6 40 00 call %i1 200753c: 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); 2007540: d2 07 bf a0 ld [ %fp + -96 ], %o1 2007544: 94 07 bf f0 add %fp, -16, %o2 2007548: 40 00 0e b0 call 200b008 <_Timespec_Divide_by_integer> 200754c: 90 07 bf d0 add %fp, -48, %o0 (*print)( context, 2007550: d0 07 bf c4 ld [ %fp + -60 ], %o0 2007554: 40 00 47 0c call 2019184 <.div> 2007558: 92 10 23 e8 mov 0x3e8, %o1 200755c: a6 10 00 08 mov %o0, %l3 2007560: d0 07 bf cc ld [ %fp + -52 ], %o0 2007564: 40 00 47 08 call 2019184 <.div> 2007568: 92 10 23 e8 mov 0x3e8, %o1 200756c: c2 07 bf f0 ld [ %fp + -16 ], %g1 2007570: a2 10 00 08 mov %o0, %l1 2007574: d0 07 bf f4 ld [ %fp + -12 ], %o0 2007578: e8 07 bf c0 ld [ %fp + -64 ], %l4 200757c: e4 07 bf c8 ld [ %fp + -56 ], %l2 2007580: 92 10 23 e8 mov 0x3e8, %o1 2007584: 40 00 47 00 call 2019184 <.div> 2007588: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 200758c: 92 10 00 1b mov %i3, %o1 2007590: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 2007594: 94 10 00 14 mov %l4, %o2 2007598: 90 10 00 18 mov %i0, %o0 200759c: 96 10 00 13 mov %l3, %o3 20075a0: 98 10 00 12 mov %l2, %o4 20075a4: 9f c6 40 00 call %i1 20075a8: 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++ ) { 20075ac: 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 ; 20075b0: 03 00 80 79 sethi %hi(0x201e400), %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 ; 20075b4: c2 00 63 10 ld [ %g1 + 0x310 ], %g1 ! 201e710 <_Rate_monotonic_Information+0xc> 20075b8: 80 a7 40 01 cmp %i5, %g1 20075bc: 08 bf ff ad bleu 2007470 20075c0: 90 10 00 1d mov %i5, %o0 20075c4: 81 c7 e0 08 ret 20075c8: 81 e8 00 00 restore =============================================================================== 020160ac : rtems_status_code rtems_signal_send( rtems_id id, rtems_signal_set signal_set ) { 20160ac: 9d e3 bf 98 save %sp, -104, %sp 20160b0: 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 ) 20160b4: 80 a6 60 00 cmp %i1, 0 20160b8: 02 80 00 2e be 2016170 20160bc: b0 10 20 0a mov 0xa, %i0 return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 20160c0: 40 00 12 45 call 201a9d4 <_Thread_Get> 20160c4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20160c8: c2 07 bf fc ld [ %fp + -4 ], %g1 ASR_Information *asr; if ( !signal_set ) return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 20160cc: b8 10 00 08 mov %o0, %i4 switch ( location ) { 20160d0: 80 a0 60 00 cmp %g1, 0 20160d4: 12 80 00 27 bne 2016170 20160d8: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 20160dc: fa 02 21 58 ld [ %o0 + 0x158 ], %i5 asr = &api->Signal; if ( ! _ASR_Is_null_handler( asr->handler ) ) { 20160e0: c2 07 60 0c ld [ %i5 + 0xc ], %g1 20160e4: 80 a0 60 00 cmp %g1, 0 20160e8: 02 80 00 24 be 2016178 20160ec: 01 00 00 00 nop if ( asr->is_enabled ) { 20160f0: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 20160f4: 80 a0 60 00 cmp %g1, 0 20160f8: 02 80 00 15 be 201614c 20160fc: 01 00 00 00 nop rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 2016100: 7f ff e7 f0 call 20100c0 2016104: 01 00 00 00 nop *signal_set |= signals; 2016108: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 201610c: b2 10 40 19 or %g1, %i1, %i1 2016110: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _ISR_Enable( _level ); 2016114: 7f ff e7 ef call 20100d0 2016118: 01 00 00 00 nop _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 201611c: 03 00 80 ee sethi %hi(0x203b800), %g1 2016120: 82 10 63 70 or %g1, 0x370, %g1 ! 203bb70 <_Per_CPU_Information> 2016124: c4 00 60 08 ld [ %g1 + 8 ], %g2 2016128: 80 a0 a0 00 cmp %g2, 0 201612c: 02 80 00 0f be 2016168 2016130: 01 00 00 00 nop 2016134: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2016138: 80 a7 00 02 cmp %i4, %g2 201613c: 12 80 00 0b bne 2016168 <== NEVER TAKEN 2016140: 84 10 20 01 mov 1, %g2 _Thread_Dispatch_necessary = true; 2016144: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 2016148: 30 80 00 08 b,a 2016168 rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 201614c: 7f ff e7 dd call 20100c0 2016150: 01 00 00 00 nop *signal_set |= signals; 2016154: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 2016158: b2 10 40 19 or %g1, %i1, %i1 201615c: f2 27 60 18 st %i1, [ %i5 + 0x18 ] _ISR_Enable( _level ); 2016160: 7f ff e7 dc call 20100d0 2016164: 01 00 00 00 nop } else { _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); 2016168: 40 00 12 0e call 201a9a0 <_Thread_Enable_dispatch> 201616c: b0 10 20 00 clr %i0 ! 0 return RTEMS_SUCCESSFUL; 2016170: 81 c7 e0 08 ret 2016174: 81 e8 00 00 restore } _Thread_Enable_dispatch(); 2016178: 40 00 12 0a call 201a9a0 <_Thread_Enable_dispatch> 201617c: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; 2016180: 81 c7 e0 08 ret 2016184: 81 e8 00 00 restore =============================================================================== 0200e468 : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { 200e468: 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 ) 200e46c: 80 a6 a0 00 cmp %i2, 0 200e470: 02 80 00 5a be 200e5d8 200e474: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; 200e478: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e47c: f8 00 63 04 ld [ %g1 + 0x304 ], %i4 ! 201cf04 <_Per_CPU_Information+0xc> api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200e480: 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 ]; 200e484: fa 07 21 58 ld [ %i4 + 0x158 ], %i5 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200e488: 80 a0 00 01 cmp %g0, %g1 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200e48c: 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; 200e490: b6 60 3f ff subx %g0, -1, %i3 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200e494: 80 a0 60 00 cmp %g1, 0 200e498: 02 80 00 03 be 200e4a4 200e49c: b7 2e e0 08 sll %i3, 8, %i3 old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; 200e4a0: b6 16 e2 00 or %i3, 0x200, %i3 old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 200e4a4: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 200e4a8: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 200e4ac: 7f ff ee f4 call 200a07c <_CPU_ISR_Get_level> 200e4b0: 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; 200e4b4: a1 2c 20 0a sll %l0, 0xa, %l0 200e4b8: a0 14 00 08 or %l0, %o0, %l0 old_mode |= _ISR_Get_level(); 200e4bc: b6 14 00 1b or %l0, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 200e4c0: 80 8e 61 00 btst 0x100, %i1 200e4c4: 02 80 00 06 be 200e4dc 200e4c8: 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; 200e4cc: 82 0e 21 00 and %i0, 0x100, %g1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; 200e4d0: 80 a0 00 01 cmp %g0, %g1 200e4d4: 82 60 3f ff subx %g0, -1, %g1 200e4d8: c2 2f 20 74 stb %g1, [ %i4 + 0x74 ] if ( mask & RTEMS_TIMESLICE_MASK ) { 200e4dc: 80 8e 62 00 btst 0x200, %i1 200e4e0: 02 80 00 0b be 200e50c 200e4e4: 80 8e 60 0f btst 0xf, %i1 if ( _Modes_Is_timeslice(mode_set) ) { 200e4e8: 80 8e 22 00 btst 0x200, %i0 200e4ec: 22 80 00 07 be,a 200e508 200e4f0: c0 27 20 7c clr [ %i4 + 0x7c ] executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 200e4f4: 82 10 20 01 mov 1, %g1 200e4f8: c2 27 20 7c st %g1, [ %i4 + 0x7c ] executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 200e4fc: 03 00 80 72 sethi %hi(0x201c800), %g1 200e500: c2 00 61 24 ld [ %g1 + 0x124 ], %g1 ! 201c924 <_Thread_Ticks_per_timeslice> 200e504: c2 27 20 78 st %g1, [ %i4 + 0x78 ] } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200e508: 80 8e 60 0f btst 0xf, %i1 200e50c: 02 80 00 06 be 200e524 200e510: 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 ); 200e514: 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 ) ); 200e518: 7f ff cf 1d call 200218c 200e51c: 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 ) { 200e520: 80 8e 64 00 btst 0x400, %i1 200e524: 02 80 00 14 be 200e574 200e528: 88 10 20 00 clr %g4 is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 200e52c: 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; 200e530: 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( 200e534: 80 a0 00 18 cmp %g0, %i0 200e538: 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 ) { 200e53c: 80 a0 40 02 cmp %g1, %g2 200e540: 22 80 00 0e be,a 200e578 200e544: 03 00 80 72 sethi %hi(0x201c800), %g1 ) { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); 200e548: 7f ff cf 0d call 200217c 200e54c: c2 2f 60 08 stb %g1, [ %i5 + 8 ] _signals = information->signals_pending; 200e550: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 information->signals_pending = information->signals_posted; 200e554: c4 07 60 14 ld [ %i5 + 0x14 ], %g2 information->signals_posted = _signals; 200e558: 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; 200e55c: c4 27 60 18 st %g2, [ %i5 + 0x18 ] information->signals_posted = _signals; _ISR_Enable( _level ); 200e560: 7f ff cf 0b call 200218c 200e564: 01 00 00 00 nop asr->is_enabled = is_asr_enabled; _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { 200e568: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 /* * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; 200e56c: 80 a0 00 01 cmp %g0, %g1 200e570: 88 40 20 00 addx %g0, 0, %g4 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) { 200e574: 03 00 80 72 sethi %hi(0x201c800), %g1 200e578: c4 00 63 14 ld [ %g1 + 0x314 ], %g2 ! 201cb14 <_System_state_Current> 200e57c: 80 a0 a0 03 cmp %g2, 3 200e580: 12 80 00 16 bne 200e5d8 200e584: 82 10 20 00 clr %g1 bool are_signals_pending ) { Thread_Control *executing; executing = _Thread_Executing; 200e588: 07 00 80 73 sethi %hi(0x201cc00), %g3 if ( are_signals_pending || 200e58c: 80 89 20 ff btst 0xff, %g4 bool are_signals_pending ) { Thread_Control *executing; executing = _Thread_Executing; 200e590: 86 10 e2 f8 or %g3, 0x2f8, %g3 if ( are_signals_pending || 200e594: 12 80 00 0a bne 200e5bc 200e598: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 200e59c: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3 200e5a0: 80 a0 80 03 cmp %g2, %g3 200e5a4: 02 80 00 0d be 200e5d8 200e5a8: 01 00 00 00 nop (!_Thread_Is_heir( executing ) && executing->is_preemptible) ) { 200e5ac: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 200e5b0: 80 a0 a0 00 cmp %g2, 0 200e5b4: 02 80 00 09 be 200e5d8 <== NEVER TAKEN 200e5b8: 01 00 00 00 nop _Thread_Dispatch_necessary = true; 200e5bc: 84 10 20 01 mov 1, %g2 ! 1 200e5c0: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e5c4: 82 10 62 f8 or %g1, 0x2f8, %g1 ! 201cef8 <_Per_CPU_Information> 200e5c8: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); 200e5cc: 7f ff e9 6f call 2008b88 <_Thread_Dispatch> 200e5d0: 01 00 00 00 nop } return RTEMS_SUCCESSFUL; 200e5d4: 82 10 20 00 clr %g1 ! 0 } 200e5d8: 81 c7 e0 08 ret 200e5dc: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200a9f8 : rtems_status_code rtems_task_set_priority( rtems_id id, rtems_task_priority new_priority, rtems_task_priority *old_priority ) { 200a9f8: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; if ( new_priority != RTEMS_CURRENT_PRIORITY && 200a9fc: 80 a6 60 00 cmp %i1, 0 200aa00: 02 80 00 07 be 200aa1c 200aa04: 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 ) ); 200aa08: 03 00 80 65 sethi %hi(0x2019400), %g1 200aa0c: c2 08 61 ec ldub [ %g1 + 0x1ec ], %g1 ! 20195ec 200aa10: 80 a6 40 01 cmp %i1, %g1 200aa14: 18 80 00 1c bgu 200aa84 200aa18: b0 10 20 13 mov 0x13, %i0 !_RTEMS_tasks_Priority_is_valid( new_priority ) ) return RTEMS_INVALID_PRIORITY; if ( !old_priority ) 200aa1c: 80 a6 a0 00 cmp %i2, 0 200aa20: 02 80 00 19 be 200aa84 200aa24: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get( id, &location ); 200aa28: 40 00 09 87 call 200d044 <_Thread_Get> 200aa2c: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200aa30: c2 07 bf fc ld [ %fp + -4 ], %g1 200aa34: 80 a0 60 00 cmp %g1, 0 200aa38: 12 80 00 13 bne 200aa84 200aa3c: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* XXX need helper to "convert" from core priority */ *old_priority = the_thread->current_priority; 200aa40: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( new_priority != RTEMS_CURRENT_PRIORITY ) { 200aa44: 80 a6 60 00 cmp %i1, 0 200aa48: 02 80 00 0d be 200aa7c 200aa4c: c2 26 80 00 st %g1, [ %i2 ] the_thread->real_priority = new_priority; if ( the_thread->resource_count == 0 || 200aa50: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 200aa54: 80 a0 60 00 cmp %g1, 0 200aa58: 02 80 00 06 be 200aa70 200aa5c: f2 22 20 18 st %i1, [ %o0 + 0x18 ] 200aa60: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200aa64: 80 a0 40 19 cmp %g1, %i1 200aa68: 08 80 00 05 bleu 200aa7c <== ALWAYS TAKEN 200aa6c: 01 00 00 00 nop the_thread->current_priority > new_priority ) _Thread_Change_priority( the_thread, new_priority, false ); 200aa70: 92 10 00 19 mov %i1, %o1 200aa74: 40 00 08 43 call 200cb80 <_Thread_Change_priority> 200aa78: 94 10 20 00 clr %o2 } _Thread_Enable_dispatch(); 200aa7c: 40 00 09 65 call 200d010 <_Thread_Enable_dispatch> 200aa80: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 200aa84: 81 c7 e0 08 ret 200aa88: 81 e8 00 00 restore =============================================================================== 02016ab4 : */ rtems_status_code rtems_timer_cancel( rtems_id id ) { 2016ab4: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get ( Objects_Id id, Objects_Locations *location ) { return (Timer_Control *) 2016ab8: 11 00 80 ef sethi %hi(0x203bc00), %o0 2016abc: 92 10 00 18 mov %i0, %o1 2016ac0: 90 12 23 b4 or %o0, 0x3b4, %o0 2016ac4: 40 00 0b fb call 2019ab0 <_Objects_Get> 2016ac8: 94 07 bf fc add %fp, -4, %o2 Timer_Control *the_timer; Objects_Locations location; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2016acc: c2 07 bf fc ld [ %fp + -4 ], %g1 2016ad0: 80 a0 60 00 cmp %g1, 0 2016ad4: 12 80 00 0c bne 2016b04 2016ad8: 01 00 00 00 nop case OBJECTS_LOCAL: if ( !_Timer_Is_dormant_class( the_timer->the_class ) ) 2016adc: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2016ae0: 80 a0 60 04 cmp %g1, 4 2016ae4: 02 80 00 04 be 2016af4 <== NEVER TAKEN 2016ae8: 01 00 00 00 nop (void) _Watchdog_Remove( &the_timer->Ticker ); 2016aec: 40 00 14 2c call 201bb9c <_Watchdog_Remove> 2016af0: 90 02 20 10 add %o0, 0x10, %o0 _Thread_Enable_dispatch(); 2016af4: 40 00 0f ab call 201a9a0 <_Thread_Enable_dispatch> 2016af8: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2016afc: 81 c7 e0 08 ret 2016b00: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2016b04: 81 c7 e0 08 ret 2016b08: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 02016fb0 : rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 2016fb0: 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; 2016fb4: 03 00 80 ef sethi %hi(0x203bc00), %g1 2016fb8: f8 00 63 f4 ld [ %g1 + 0x3f4 ], %i4 ! 203bff4 <_Timer_server> rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 2016fbc: 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 ) 2016fc0: 80 a7 20 00 cmp %i4, 0 2016fc4: 02 80 00 32 be 201708c 2016fc8: b0 10 20 0e mov 0xe, %i0 return RTEMS_INCORRECT_STATE; if ( !_TOD_Is_set ) 2016fcc: 03 00 80 ed sethi %hi(0x203b400), %g1 2016fd0: c2 08 62 40 ldub [ %g1 + 0x240 ], %g1 ! 203b640 <_TOD_Is_set> 2016fd4: 80 a0 60 00 cmp %g1, 0 2016fd8: 02 80 00 2d be 201708c <== NEVER TAKEN 2016fdc: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; if ( !routine ) 2016fe0: 80 a6 a0 00 cmp %i2, 0 2016fe4: 02 80 00 2a be 201708c 2016fe8: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) 2016fec: 90 10 00 19 mov %i1, %o0 2016ff0: 7f ff f4 11 call 2014034 <_TOD_Validate> 2016ff4: b0 10 20 14 mov 0x14, %i0 2016ff8: 80 8a 20 ff btst 0xff, %o0 2016ffc: 02 80 00 27 be 2017098 2017000: 01 00 00 00 nop return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 2017004: 7f ff f3 d8 call 2013f64 <_TOD_To_seconds> 2017008: 90 10 00 19 mov %i1, %o0 if ( seconds <= _TOD_Seconds_since_epoch() ) 201700c: 21 00 80 ed sethi %hi(0x203b400), %l0 2017010: c2 04 22 bc ld [ %l0 + 0x2bc ], %g1 ! 203b6bc <_TOD_Now> 2017014: 80 a2 00 01 cmp %o0, %g1 2017018: 08 80 00 1d bleu 201708c 201701c: b2 10 00 08 mov %o0, %i1 2017020: 11 00 80 ef sethi %hi(0x203bc00), %o0 2017024: 92 10 00 1d mov %i5, %o1 2017028: 90 12 23 b4 or %o0, 0x3b4, %o0 201702c: 40 00 0a a1 call 2019ab0 <_Objects_Get> 2017030: 94 07 bf fc add %fp, -4, %o2 return RTEMS_INVALID_CLOCK; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2017034: c2 07 bf fc ld [ %fp + -4 ], %g1 2017038: 80 a0 60 00 cmp %g1, 0 201703c: 12 80 00 16 bne 2017094 2017040: b0 10 00 08 mov %o0, %i0 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); 2017044: 40 00 12 d6 call 201bb9c <_Watchdog_Remove> 2017048: 90 02 20 10 add %o0, 0x10, %o0 the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; 201704c: 82 10 20 03 mov 3, %g1 2017050: 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(); 2017054: c2 04 22 bc ld [ %l0 + 0x2bc ], %g1 (*timer_server->schedule_operation)( timer_server, the_timer ); 2017058: 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(); 201705c: b2 26 40 01 sub %i1, %g1, %i1 (*timer_server->schedule_operation)( timer_server, the_timer ); 2017060: c2 07 20 04 ld [ %i4 + 4 ], %g1 2017064: 90 10 00 1c mov %i4, %o0 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2017068: c0 26 20 18 clr [ %i0 + 0x18 ] the_watchdog->routine = routine; 201706c: f4 26 20 2c st %i2, [ %i0 + 0x2c ] the_watchdog->id = id; 2017070: fa 26 20 30 st %i5, [ %i0 + 0x30 ] the_watchdog->user_data = user_data; 2017074: 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(); 2017078: f2 26 20 1c st %i1, [ %i0 + 0x1c ] (*timer_server->schedule_operation)( timer_server, the_timer ); 201707c: 9f c0 40 00 call %g1 2017080: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 2017084: 40 00 0e 47 call 201a9a0 <_Thread_Enable_dispatch> 2017088: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 201708c: 81 c7 e0 08 ret 2017090: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 2017094: b0 10 20 04 mov 4, %i0 } 2017098: 81 c7 e0 08 ret 201709c: 81 e8 00 00 restore =============================================================================== 02006768 : #include int sched_get_priority_max( int policy ) { 2006768: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 200676c: 80 a6 20 04 cmp %i0, 4 2006770: 18 80 00 06 bgu 2006788 2006774: 82 10 20 01 mov 1, %g1 2006778: b1 28 40 18 sll %g1, %i0, %i0 200677c: 80 8e 20 17 btst 0x17, %i0 2006780: 12 80 00 08 bne 20067a0 <== ALWAYS TAKEN 2006784: 03 00 80 71 sethi %hi(0x201c400), %g1 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2006788: 40 00 22 9b call 200f1f4 <__errno> 200678c: b0 10 3f ff mov -1, %i0 2006790: 82 10 20 16 mov 0x16, %g1 2006794: c2 22 00 00 st %g1, [ %o0 ] 2006798: 81 c7 e0 08 ret 200679c: 81 e8 00 00 restore } return POSIX_SCHEDULER_MAXIMUM_PRIORITY; 20067a0: f0 08 62 6c ldub [ %g1 + 0x26c ], %i0 } 20067a4: 81 c7 e0 08 ret 20067a8: 91 ee 3f ff restore %i0, -1, %o0 =============================================================================== 020067ac : #include int sched_get_priority_min( int policy ) { 20067ac: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 20067b0: 80 a6 20 04 cmp %i0, 4 20067b4: 18 80 00 06 bgu 20067cc 20067b8: 82 10 20 01 mov 1, %g1 20067bc: 83 28 40 18 sll %g1, %i0, %g1 20067c0: 80 88 60 17 btst 0x17, %g1 20067c4: 12 80 00 06 bne 20067dc <== ALWAYS TAKEN 20067c8: b0 10 20 01 mov 1, %i0 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 20067cc: 40 00 22 8a call 200f1f4 <__errno> 20067d0: b0 10 3f ff mov -1, %i0 20067d4: 82 10 20 16 mov 0x16, %g1 20067d8: c2 22 00 00 st %g1, [ %o0 ] } return POSIX_SCHEDULER_MINIMUM_PRIORITY; } 20067dc: 81 c7 e0 08 ret 20067e0: 81 e8 00 00 restore =============================================================================== 020067e4 : int sched_rr_get_interval( pid_t pid, struct timespec *interval ) { 20067e4: 9d e3 bf a0 save %sp, -96, %sp /* * Only supported for the "calling process" (i.e. this node). */ if ( pid && pid != getpid() ) 20067e8: 80 a6 20 00 cmp %i0, 0 20067ec: 02 80 00 0b be 2006818 <== NEVER TAKEN 20067f0: 80 a6 60 00 cmp %i1, 0 20067f4: 7f ff f2 65 call 2003188 20067f8: 01 00 00 00 nop 20067fc: 80 a6 00 08 cmp %i0, %o0 2006800: 02 80 00 06 be 2006818 2006804: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); 2006808: 40 00 22 7b call 200f1f4 <__errno> 200680c: 01 00 00 00 nop 2006810: 10 80 00 07 b 200682c 2006814: 82 10 20 03 mov 3, %g1 ! 3 if ( !interval ) 2006818: 12 80 00 08 bne 2006838 200681c: 03 00 80 74 sethi %hi(0x201d000), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 2006820: 40 00 22 75 call 200f1f4 <__errno> 2006824: 01 00 00 00 nop 2006828: 82 10 20 16 mov 0x16, %g1 ! 16 200682c: c2 22 00 00 st %g1, [ %o0 ] 2006830: 81 c7 e0 08 ret 2006834: 91 e8 3f ff restore %g0, -1, %o0 _Timespec_From_ticks( _Thread_Ticks_per_timeslice, interval ); 2006838: d0 00 62 b4 ld [ %g1 + 0x2b4 ], %o0 200683c: 92 10 00 19 mov %i1, %o1 2006840: 40 00 0e 8e call 200a278 <_Timespec_From_ticks> 2006844: b0 10 20 00 clr %i0 return 0; } 2006848: 81 c7 e0 08 ret 200684c: 81 e8 00 00 restore =============================================================================== 02009450 : int oflag, ... /* mode_t mode, */ /* unsigned int value */ ) { 2009450: 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++; 2009454: 03 00 80 89 sethi %hi(0x2022400), %g1 2009458: c4 00 62 20 ld [ %g1 + 0x220 ], %g2 ! 2022620 <_Thread_Dispatch_disable_level> Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 200945c: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 2009460: 84 00 a0 01 inc %g2 2009464: c4 20 62 20 st %g2, [ %g1 + 0x220 ] return _Thread_Dispatch_disable_level; 2009468: c2 00 62 20 ld [ %g1 + 0x220 ], %g1 200946c: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 2009470: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 2009474: fa 27 a0 58 st %i5, [ %fp + 0x58 ] POSIX_Semaphore_Control *the_semaphore; Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { 2009478: b8 8e 62 00 andcc %i1, 0x200, %i4 200947c: 02 80 00 05 be 2009490 2009480: ba 10 20 00 clr %i5 va_start(arg, oflag); mode = (mode_t) va_arg( arg, unsigned int ); value = va_arg( arg, unsigned int ); 2009484: fa 07 a0 50 ld [ %fp + 0x50 ], %i5 2009488: 82 07 a0 54 add %fp, 0x54, %g1 200948c: c2 27 bf f0 st %g1, [ %fp + -16 ] va_end(arg); } status = _POSIX_Semaphore_Name_to_id( name, &the_semaphore_id ); 2009490: 90 10 00 18 mov %i0, %o0 2009494: 40 00 1a 1b call 200fd00 <_POSIX_Semaphore_Name_to_id> 2009498: 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 ) { 200949c: b6 92 20 00 orcc %o0, 0, %i3 20094a0: 22 80 00 0e be,a 20094d8 20094a4: 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) ) ) { 20094a8: 80 a6 e0 02 cmp %i3, 2 20094ac: 12 80 00 04 bne 20094bc <== NEVER TAKEN 20094b0: 80 a7 20 00 cmp %i4, 0 20094b4: 12 80 00 21 bne 2009538 20094b8: 94 10 00 1d mov %i5, %o2 _Thread_Enable_dispatch(); 20094bc: 40 00 0c 25 call 200c550 <_Thread_Enable_dispatch> 20094c0: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, sem_t * ); 20094c4: 40 00 25 b0 call 2012b84 <__errno> 20094c8: 01 00 00 00 nop 20094cc: f6 22 00 00 st %i3, [ %o0 ] 20094d0: 81 c7 e0 08 ret 20094d4: 81 e8 00 00 restore /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { 20094d8: 80 a6 6a 00 cmp %i1, 0xa00 20094dc: 12 80 00 0a bne 2009504 20094e0: d2 07 bf f4 ld [ %fp + -12 ], %o1 _Thread_Enable_dispatch(); 20094e4: 40 00 0c 1b call 200c550 <_Thread_Enable_dispatch> 20094e8: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); 20094ec: 40 00 25 a6 call 2012b84 <__errno> 20094f0: 01 00 00 00 nop 20094f4: 82 10 20 11 mov 0x11, %g1 ! 11 20094f8: c2 22 00 00 st %g1, [ %o0 ] 20094fc: 81 c7 e0 08 ret 2009500: 81 e8 00 00 restore 2009504: 94 07 bf fc add %fp, -4, %o2 2009508: 11 00 80 8a sethi %hi(0x2022800), %o0 200950c: 40 00 08 61 call 200b690 <_Objects_Get> 2009510: 90 12 20 e0 or %o0, 0xe0, %o0 ! 20228e0 <_POSIX_Semaphore_Information> } the_semaphore = _POSIX_Semaphore_Get( &the_semaphore_id, &location ); the_semaphore->open_count += 1; 2009514: 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 ); 2009518: d0 27 bf f8 st %o0, [ %fp + -8 ] the_semaphore->open_count += 1; 200951c: 82 00 60 01 inc %g1 _Thread_Enable_dispatch(); 2009520: 40 00 0c 0c call 200c550 <_Thread_Enable_dispatch> 2009524: c2 22 20 18 st %g1, [ %o0 + 0x18 ] _Thread_Enable_dispatch(); 2009528: 40 00 0c 0a call 200c550 <_Thread_Enable_dispatch> 200952c: 01 00 00 00 nop goto return_id; 2009530: 10 80 00 0c b 2009560 2009534: 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( 2009538: 90 10 00 18 mov %i0, %o0 200953c: 92 10 20 00 clr %o1 2009540: 40 00 19 98 call 200fba0 <_POSIX_Semaphore_Create_support> 2009544: 96 07 bf f8 add %fp, -8, %o3 /* * errno was set by Create_support, so don't set it again. */ _Thread_Enable_dispatch(); 2009548: 40 00 0c 02 call 200c550 <_Thread_Enable_dispatch> 200954c: ba 10 00 08 mov %o0, %i5 if ( status == -1 ) 2009550: 80 a7 7f ff cmp %i5, -1 2009554: 02 bf ff ea be 20094fc 2009558: 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; 200955c: f0 07 bf f8 ld [ %fp + -8 ], %i0 2009560: b0 06 20 08 add %i0, 8, %i0 } 2009564: 81 c7 e0 08 ret 2009568: 81 e8 00 00 restore =============================================================================== 020066fc : int sigaction( int sig, const struct sigaction *act, struct sigaction *oact ) { 20066fc: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; if ( oact ) 2006700: 90 96 a0 00 orcc %i2, 0, %o0 2006704: 02 80 00 09 be 2006728 2006708: 83 2e 20 02 sll %i0, 2, %g1 *oact = _POSIX_signals_Vectors[ sig ]; 200670c: 85 2e 20 04 sll %i0, 4, %g2 2006710: 82 20 80 01 sub %g2, %g1, %g1 2006714: 13 00 80 66 sethi %hi(0x2019800), %o1 2006718: 94 10 20 0c mov 0xc, %o2 200671c: 92 12 61 f0 or %o1, 0x1f0, %o1 2006720: 40 00 26 0f call 200ff5c 2006724: 92 02 40 01 add %o1, %g1, %o1 if ( !sig ) 2006728: 80 a6 20 00 cmp %i0, 0 200672c: 02 80 00 09 be 2006750 2006730: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 2006734: 82 06 3f ff add %i0, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 2006738: 80 a0 60 1f cmp %g1, 0x1f 200673c: 18 80 00 05 bgu 2006750 2006740: 01 00 00 00 nop * * NOTE: Solaris documentation claims to "silently enforce" this which * contradicts the POSIX specification. */ if ( sig == SIGKILL ) 2006744: 80 a6 20 09 cmp %i0, 9 2006748: 12 80 00 08 bne 2006768 200674c: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); 2006750: 40 00 23 bd call 200f644 <__errno> 2006754: 01 00 00 00 nop 2006758: 82 10 20 16 mov 0x16, %g1 ! 16 200675c: c2 22 00 00 st %g1, [ %o0 ] 2006760: 10 80 00 20 b 20067e0 2006764: 82 10 3f ff mov -1, %g1 /* * Evaluate the new action structure and set the global signal vector * appropriately. */ if ( act ) { 2006768: 02 80 00 1e be 20067e0 <== NEVER TAKEN 200676c: 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 ); 2006770: 7f ff ef 6b call 200251c 2006774: 01 00 00 00 nop 2006778: ba 10 00 08 mov %o0, %i5 if ( act->sa_handler == SIG_DFL ) { 200677c: c2 06 60 08 ld [ %i1 + 8 ], %g1 2006780: 39 00 80 66 sethi %hi(0x2019800), %i4 2006784: 80 a0 60 00 cmp %g1, 0 2006788: 12 80 00 0a bne 20067b0 200678c: b8 17 21 f0 or %i4, 0x1f0, %i4 _POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ]; 2006790: 83 2e 20 02 sll %i0, 2, %g1 2006794: 13 00 80 5f sethi %hi(0x2017c00), %o1 2006798: b1 2e 20 04 sll %i0, 4, %i0 200679c: 92 12 62 9c or %o1, 0x29c, %o1 20067a0: b0 26 00 01 sub %i0, %g1, %i0 20067a4: 90 07 00 18 add %i4, %i0, %o0 20067a8: 10 80 00 09 b 20067cc 20067ac: 92 02 40 18 add %o1, %i0, %o1 } else { _POSIX_signals_Clear_process_signals( sig ); 20067b0: 40 00 18 0b call 200c7dc <_POSIX_signals_Clear_process_signals> 20067b4: 90 10 00 18 mov %i0, %o0 _POSIX_signals_Vectors[ sig ] = *act; 20067b8: 83 2e 20 02 sll %i0, 2, %g1 20067bc: 92 10 00 19 mov %i1, %o1 20067c0: b1 2e 20 04 sll %i0, 4, %i0 20067c4: 90 26 00 01 sub %i0, %g1, %o0 20067c8: 90 07 00 08 add %i4, %o0, %o0 20067cc: 40 00 25 e4 call 200ff5c 20067d0: 94 10 20 0c mov 0xc, %o2 } _ISR_Enable( level ); 20067d4: 7f ff ef 56 call 200252c 20067d8: 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; 20067dc: 82 10 20 00 clr %g1 } 20067e0: 81 c7 e0 08 ret 20067e4: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 02006bbc : int sigtimedwait( const sigset_t *set, siginfo_t *info, const struct timespec *timeout ) { 2006bbc: 9d e3 bf 90 save %sp, -112, %sp ISR_Level level; /* * Error check parameters before disabling interrupts. */ if ( !set ) 2006bc0: ba 96 20 00 orcc %i0, 0, %i5 2006bc4: 02 80 00 0f be 2006c00 2006bc8: 01 00 00 00 nop /* NOTE: This is very specifically a RELATIVE not ABSOLUTE time * in the Open Group specification. */ interval = 0; if ( timeout ) { 2006bcc: 80 a6 a0 00 cmp %i2, 0 2006bd0: 02 80 00 12 be 2006c18 2006bd4: a0 10 20 00 clr %l0 if ( !_Timespec_Is_valid( timeout ) ) 2006bd8: 40 00 0e bd call 200a6cc <_Timespec_Is_valid> 2006bdc: 90 10 00 1a mov %i2, %o0 2006be0: 80 8a 20 ff btst 0xff, %o0 2006be4: 02 80 00 07 be 2006c00 2006be8: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); interval = _Timespec_To_ticks( timeout ); 2006bec: 40 00 0e da call 200a754 <_Timespec_To_ticks> 2006bf0: 90 10 00 1a mov %i2, %o0 if ( !interval ) 2006bf4: a0 92 20 00 orcc %o0, 0, %l0 2006bf8: 12 80 00 09 bne 2006c1c <== ALWAYS TAKEN 2006bfc: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); 2006c00: 40 00 24 5d call 200fd74 <__errno> 2006c04: b0 10 3f ff mov -1, %i0 2006c08: 82 10 20 16 mov 0x16, %g1 2006c0c: c2 22 00 00 st %g1, [ %o0 ] 2006c10: 81 c7 e0 08 ret 2006c14: 81 e8 00 00 restore /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 2006c18: 80 a6 60 00 cmp %i1, 0 2006c1c: 22 80 00 02 be,a 2006c24 2006c20: b2 07 bf f4 add %fp, -12, %i1 the_thread = _Thread_Executing; 2006c24: 31 00 80 68 sethi %hi(0x201a000), %i0 2006c28: b0 16 21 a8 or %i0, 0x1a8, %i0 ! 201a1a8 <_Per_CPU_Information> 2006c2c: f4 06 20 0c ld [ %i0 + 0xc ], %i2 * What if they are already pending? */ /* API signals pending? */ _ISR_Disable( level ); 2006c30: 7f ff ef 16 call 2002888 2006c34: f6 06 a1 5c ld [ %i2 + 0x15c ], %i3 2006c38: b8 10 00 08 mov %o0, %i4 if ( *set & api->signals_pending ) { 2006c3c: c4 07 40 00 ld [ %i5 ], %g2 2006c40: c2 06 e0 d4 ld [ %i3 + 0xd4 ], %g1 2006c44: 80 88 80 01 btst %g2, %g1 2006c48: 22 80 00 13 be,a 2006c94 2006c4c: 03 00 80 68 sethi %hi(0x201a000), %g1 /* XXX real info later */ the_info->si_signo = _POSIX_signals_Get_lowest( api->signals_pending ); 2006c50: 7f ff ff c3 call 2006b5c <_POSIX_signals_Get_lowest> 2006c54: 90 10 00 01 mov %g1, %o0 _POSIX_signals_Clear_signals( 2006c58: 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 ); 2006c5c: 92 10 00 08 mov %o0, %o1 2006c60: d0 26 40 00 st %o0, [ %i1 ] _POSIX_signals_Clear_signals( 2006c64: 96 10 20 00 clr %o3 2006c68: 90 10 00 1b mov %i3, %o0 2006c6c: 40 00 18 d9 call 200cfd0 <_POSIX_signals_Clear_signals> 2006c70: 98 10 20 00 clr %o4 the_info->si_signo, the_info, false, false ); _ISR_Enable( level ); 2006c74: 7f ff ef 09 call 2002898 2006c78: 90 10 00 1c mov %i4, %o0 the_info->si_code = SI_USER; 2006c7c: 82 10 20 01 mov 1, %g1 the_info->si_value.sival_int = 0; 2006c80: c0 26 60 08 clr [ %i1 + 8 ] false, false ); _ISR_Enable( level ); the_info->si_code = SI_USER; 2006c84: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; return the_info->si_signo; 2006c88: f0 06 40 00 ld [ %i1 ], %i0 2006c8c: 81 c7 e0 08 ret 2006c90: 81 e8 00 00 restore } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { 2006c94: c2 00 63 f4 ld [ %g1 + 0x3f4 ], %g1 2006c98: 80 88 80 01 btst %g2, %g1 2006c9c: 22 80 00 13 be,a 2006ce8 2006ca0: 82 10 3f ff mov -1, %g1 signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 2006ca4: 7f ff ff ae call 2006b5c <_POSIX_signals_Get_lowest> 2006ca8: 90 10 00 01 mov %g1, %o0 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 2006cac: 94 10 00 19 mov %i1, %o2 } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 2006cb0: b0 10 00 08 mov %o0, %i0 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 2006cb4: 96 10 20 01 mov 1, %o3 2006cb8: 90 10 00 1b mov %i3, %o0 2006cbc: 92 10 00 18 mov %i0, %o1 2006cc0: 40 00 18 c4 call 200cfd0 <_POSIX_signals_Clear_signals> 2006cc4: 98 10 20 00 clr %o4 _ISR_Enable( level ); 2006cc8: 7f ff ee f4 call 2002898 2006ccc: 90 10 00 1c mov %i4, %o0 the_info->si_signo = signo; the_info->si_code = SI_USER; 2006cd0: 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; 2006cd4: f0 26 40 00 st %i0, [ %i1 ] the_info->si_code = SI_USER; 2006cd8: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; 2006cdc: c0 26 60 08 clr [ %i1 + 8 ] return signo; 2006ce0: 81 c7 e0 08 ret 2006ce4: 81 e8 00 00 restore } the_info->si_signo = -1; 2006ce8: 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++; 2006cec: 03 00 80 67 sethi %hi(0x2019c00), %g1 2006cf0: c4 00 60 70 ld [ %g1 + 0x70 ], %g2 ! 2019c70 <_Thread_Dispatch_disable_level> 2006cf4: 84 00 a0 01 inc %g2 2006cf8: c4 20 60 70 st %g2, [ %g1 + 0x70 ] return _Thread_Dispatch_disable_level; 2006cfc: c2 00 60 70 ld [ %g1 + 0x70 ], %g1 _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; the_thread->Wait.return_code = EINTR; 2006d00: 82 10 20 04 mov 4, %g1 2006d04: c2 26 a0 34 st %g1, [ %i2 + 0x34 ] the_thread->Wait.option = *set; 2006d08: c2 07 40 00 ld [ %i5 ], %g1 the_thread->Wait.return_argument = the_info; 2006d0c: 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; 2006d10: 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; 2006d14: b8 10 20 01 mov 1, %i4 } the_info->si_signo = -1; _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; 2006d18: 23 00 80 68 sethi %hi(0x201a000), %l1 2006d1c: a2 14 63 8c or %l1, 0x38c, %l1 ! 201a38c <_POSIX_signals_Wait_queue> 2006d20: e2 26 a0 44 st %l1, [ %i2 + 0x44 ] 2006d24: 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 ); 2006d28: 7f ff ee dc call 2002898 2006d2c: 01 00 00 00 nop _Thread_queue_Enqueue( &_POSIX_signals_Wait_queue, interval ); 2006d30: 90 10 00 11 mov %l1, %o0 2006d34: 92 10 00 10 mov %l0, %o1 2006d38: 15 00 80 29 sethi %hi(0x200a400), %o2 2006d3c: 40 00 0c e6 call 200a0d4 <_Thread_queue_Enqueue_with_handler> 2006d40: 94 12 a0 40 or %o2, 0x40, %o2 ! 200a440 <_Thread_queue_Timeout> _Thread_Enable_dispatch(); 2006d44: 40 00 0b a9 call 2009be8 <_Thread_Enable_dispatch> 2006d48: 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 ); 2006d4c: d2 06 40 00 ld [ %i1 ], %o1 2006d50: 90 10 00 1b mov %i3, %o0 2006d54: 94 10 00 19 mov %i1, %o2 2006d58: 96 10 20 00 clr %o3 2006d5c: 40 00 18 9d call 200cfd0 <_POSIX_signals_Clear_signals> 2006d60: 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) 2006d64: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2006d68: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2006d6c: 80 a0 60 04 cmp %g1, 4 2006d70: 12 80 00 09 bne 2006d94 2006d74: 01 00 00 00 nop || !(*set & signo_to_mask( the_info->si_signo )) ) { 2006d78: f0 06 40 00 ld [ %i1 ], %i0 2006d7c: 82 06 3f ff add %i0, -1, %g1 2006d80: b9 2f 00 01 sll %i4, %g1, %i4 2006d84: c2 07 40 00 ld [ %i5 ], %g1 2006d88: 80 8f 00 01 btst %i4, %g1 2006d8c: 12 80 00 08 bne 2006dac 2006d90: 01 00 00 00 nop errno = _Thread_Executing->Wait.return_code; 2006d94: 40 00 23 f8 call 200fd74 <__errno> 2006d98: b0 10 3f ff mov -1, %i0 ! ffffffff 2006d9c: 03 00 80 68 sethi %hi(0x201a000), %g1 2006da0: c2 00 61 b4 ld [ %g1 + 0x1b4 ], %g1 ! 201a1b4 <_Per_CPU_Information+0xc> 2006da4: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2006da8: c2 22 00 00 st %g1, [ %o0 ] return -1; } return the_info->si_signo; } 2006dac: 81 c7 e0 08 ret 2006db0: 81 e8 00 00 restore =============================================================================== 02008af8 : int sigwait( const sigset_t *set, int *sig ) { 2008af8: 9d e3 bf a0 save %sp, -96, %sp int status; status = sigtimedwait( set, NULL, NULL ); 2008afc: 92 10 20 00 clr %o1 2008b00: 90 10 00 18 mov %i0, %o0 2008b04: 7f ff ff 7b call 20088f0 2008b08: 94 10 20 00 clr %o2 if ( status != -1 ) { 2008b0c: 80 a2 3f ff cmp %o0, -1 2008b10: 02 80 00 07 be 2008b2c 2008b14: 80 a6 60 00 cmp %i1, 0 if ( sig ) 2008b18: 02 80 00 03 be 2008b24 <== NEVER TAKEN 2008b1c: b0 10 20 00 clr %i0 *sig = status; 2008b20: d0 26 40 00 st %o0, [ %i1 ] 2008b24: 81 c7 e0 08 ret 2008b28: 81 e8 00 00 restore return 0; } return errno; 2008b2c: 40 00 23 39 call 2011810 <__errno> 2008b30: 01 00 00 00 nop 2008b34: f0 02 00 00 ld [ %o0 ], %i0 } 2008b38: 81 c7 e0 08 ret 2008b3c: 81 e8 00 00 restore =============================================================================== 02005a94 : */ long sysconf( int name ) { 2005a94: 9d e3 bf a0 save %sp, -96, %sp if ( name == _SC_CLK_TCK ) 2005a98: 80 a6 20 02 cmp %i0, 2 2005a9c: 12 80 00 09 bne 2005ac0 2005aa0: 03 00 80 58 sethi %hi(0x2016000), %g1 return (TOD_MICROSECONDS_PER_SECOND / 2005aa4: 03 00 80 58 sethi %hi(0x2016000), %g1 2005aa8: d2 00 61 d8 ld [ %g1 + 0x1d8 ], %o1 ! 20161d8 2005aac: 11 00 03 d0 sethi %hi(0xf4000), %o0 2005ab0: 40 00 33 04 call 20126c0 <.udiv> 2005ab4: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 2005ab8: 81 c7 e0 08 ret 2005abc: 91 e8 00 08 restore %g0, %o0, %o0 rtems_configuration_get_microseconds_per_tick()); if ( name == _SC_OPEN_MAX ) 2005ac0: 80 a6 20 04 cmp %i0, 4 2005ac4: 02 80 00 10 be 2005b04 2005ac8: d0 00 63 14 ld [ %g1 + 0x314 ], %o0 return rtems_libio_number_iops; if ( name == _SC_GETPW_R_SIZE_MAX ) 2005acc: 80 a6 20 33 cmp %i0, 0x33 2005ad0: 02 80 00 0d be 2005b04 2005ad4: 90 10 24 00 mov 0x400, %o0 return 1024; if ( name == _SC_PAGESIZE ) 2005ad8: 80 a6 20 08 cmp %i0, 8 2005adc: 02 80 00 0a be 2005b04 2005ae0: 11 00 00 04 sethi %hi(0x1000), %o0 return PAGE_SIZE; #if defined(__sparc__) if ( name == 515 ) /* Solaris _SC_STACK_PROT */ 2005ae4: 80 a6 22 03 cmp %i0, 0x203 2005ae8: 02 80 00 07 be 2005b04 <== NEVER TAKEN 2005aec: 90 10 20 00 clr %o0 return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); 2005af0: 40 00 23 ad call 200e9a4 <__errno> 2005af4: 01 00 00 00 nop 2005af8: 82 10 20 16 mov 0x16, %g1 ! 16 2005afc: c2 22 00 00 st %g1, [ %o0 ] 2005b00: 90 10 3f ff mov -1, %o0 } 2005b04: b0 10 00 08 mov %o0, %i0 2005b08: 81 c7 e0 08 ret 2005b0c: 81 e8 00 00 restore =============================================================================== 02005e38 : int timer_create( clockid_t clock_id, struct sigevent *evp, timer_t *timerid ) { 2005e38: 9d e3 bf a0 save %sp, -96, %sp POSIX_Timer_Control *ptimer; if ( clock_id != CLOCK_REALTIME ) 2005e3c: 80 a6 20 01 cmp %i0, 1 2005e40: 12 80 00 15 bne 2005e94 2005e44: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); if ( !timerid ) 2005e48: 80 a6 a0 00 cmp %i2, 0 2005e4c: 02 80 00 12 be 2005e94 2005e50: 01 00 00 00 nop /* * The data of the structure evp are checked in order to verify if they * are coherent. */ if (evp != NULL) { 2005e54: 80 a6 60 00 cmp %i1, 0 2005e58: 02 80 00 13 be 2005ea4 2005e5c: 03 00 80 74 sethi %hi(0x201d000), %g1 /* The structure has data */ if ( ( evp->sigev_notify != SIGEV_NONE ) && 2005e60: c2 06 40 00 ld [ %i1 ], %g1 2005e64: 82 00 7f ff add %g1, -1, %g1 2005e68: 80 a0 60 01 cmp %g1, 1 2005e6c: 18 80 00 0a bgu 2005e94 <== NEVER TAKEN 2005e70: 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 ) 2005e74: c2 06 60 04 ld [ %i1 + 4 ], %g1 2005e78: 80 a0 60 00 cmp %g1, 0 2005e7c: 02 80 00 06 be 2005e94 <== NEVER TAKEN 2005e80: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 2005e84: 82 00 7f ff add %g1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(evp->sigev_signo) ) 2005e88: 80 a0 60 1f cmp %g1, 0x1f 2005e8c: 28 80 00 06 bleu,a 2005ea4 <== ALWAYS TAKEN 2005e90: 03 00 80 74 sethi %hi(0x201d000), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 2005e94: 40 00 24 d4 call 200f1e4 <__errno> 2005e98: 01 00 00 00 nop 2005e9c: 10 80 00 11 b 2005ee0 2005ea0: 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++; 2005ea4: c4 00 63 60 ld [ %g1 + 0x360 ], %g2 2005ea8: 84 00 a0 01 inc %g2 2005eac: c4 20 63 60 st %g2, [ %g1 + 0x360 ] return _Thread_Dispatch_disable_level; 2005eb0: c2 00 63 60 ld [ %g1 + 0x360 ], %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 ); 2005eb4: 11 00 80 75 sethi %hi(0x201d400), %o0 2005eb8: 40 00 07 e7 call 2007e54 <_Objects_Allocate> 2005ebc: 90 12 22 60 or %o0, 0x260, %o0 ! 201d660 <_POSIX_Timer_Information> /* * Allocate a timer */ ptimer = _POSIX_Timer_Allocate(); if ( !ptimer ) { 2005ec0: 80 a2 20 00 cmp %o0, 0 2005ec4: 12 80 00 0a bne 2005eec 2005ec8: 82 10 20 02 mov 2, %g1 _Thread_Enable_dispatch(); 2005ecc: 40 00 0c ae call 2009184 <_Thread_Enable_dispatch> 2005ed0: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EAGAIN ); 2005ed4: 40 00 24 c4 call 200f1e4 <__errno> 2005ed8: 01 00 00 00 nop 2005edc: 82 10 20 0b mov 0xb, %g1 ! b 2005ee0: c2 22 00 00 st %g1, [ %o0 ] 2005ee4: 81 c7 e0 08 ret 2005ee8: 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; 2005eec: c2 2a 20 3c stb %g1, [ %o0 + 0x3c ] ptimer->thread_id = _Thread_Executing->Object.id; 2005ef0: 03 00 80 76 sethi %hi(0x201d800), %g1 2005ef4: c2 00 60 a4 ld [ %g1 + 0xa4 ], %g1 ! 201d8a4 <_Per_CPU_Information+0xc> if ( evp != NULL ) { 2005ef8: 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; 2005efc: c2 00 60 08 ld [ %g1 + 8 ], %g1 if ( evp != NULL ) { 2005f00: 02 80 00 08 be 2005f20 2005f04: c2 22 20 38 st %g1, [ %o0 + 0x38 ] ptimer->inf.sigev_notify = evp->sigev_notify; 2005f08: c2 06 40 00 ld [ %i1 ], %g1 2005f0c: c2 22 20 40 st %g1, [ %o0 + 0x40 ] ptimer->inf.sigev_signo = evp->sigev_signo; 2005f10: c2 06 60 04 ld [ %i1 + 4 ], %g1 2005f14: c2 22 20 44 st %g1, [ %o0 + 0x44 ] ptimer->inf.sigev_value = evp->sigev_value; 2005f18: c2 06 60 08 ld [ %i1 + 8 ], %g1 2005f1c: c2 22 20 48 st %g1, [ %o0 + 0x48 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2005f20: c4 12 20 0a lduh [ %o0 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2005f24: 07 00 80 75 sethi %hi(0x201d400), %g3 2005f28: c6 00 e2 7c ld [ %g3 + 0x27c ], %g3 ! 201d67c <_POSIX_Timer_Information+0x1c> } ptimer->overrun = 0; 2005f2c: c0 22 20 68 clr [ %o0 + 0x68 ] ptimer->timer_data.it_value.tv_sec = 0; 2005f30: c0 22 20 5c clr [ %o0 + 0x5c ] ptimer->timer_data.it_value.tv_nsec = 0; 2005f34: c0 22 20 60 clr [ %o0 + 0x60 ] ptimer->timer_data.it_interval.tv_sec = 0; 2005f38: c0 22 20 54 clr [ %o0 + 0x54 ] ptimer->timer_data.it_interval.tv_nsec = 0; 2005f3c: c0 22 20 58 clr [ %o0 + 0x58 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2005f40: c0 22 20 18 clr [ %o0 + 0x18 ] the_watchdog->routine = routine; 2005f44: c0 22 20 2c clr [ %o0 + 0x2c ] the_watchdog->id = id; 2005f48: c0 22 20 30 clr [ %o0 + 0x30 ] the_watchdog->user_data = user_data; 2005f4c: c0 22 20 34 clr [ %o0 + 0x34 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2005f50: c2 02 20 08 ld [ %o0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2005f54: 85 28 a0 02 sll %g2, 2, %g2 2005f58: 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; 2005f5c: 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; 2005f60: c2 26 80 00 st %g1, [ %i2 ] _Thread_Enable_dispatch(); 2005f64: 40 00 0c 88 call 2009184 <_Thread_Enable_dispatch> 2005f68: b0 10 20 00 clr %i0 return 0; } 2005f6c: 81 c7 e0 08 ret 2005f70: 81 e8 00 00 restore =============================================================================== 02005f74 : timer_t timerid, int flags, const struct itimerspec *value, struct itimerspec *ovalue ) { 2005f74: 9d e3 bf 80 save %sp, -128, %sp Objects_Locations location; bool activated; uint32_t initial_period; struct itimerspec normalize; if ( !value ) 2005f78: 80 a6 a0 00 cmp %i2, 0 2005f7c: 02 80 00 20 be 2005ffc <== NEVER TAKEN 2005f80: 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) ) ) { 2005f84: 40 00 0f 49 call 2009ca8 <_Timespec_Is_valid> 2005f88: 90 06 a0 08 add %i2, 8, %o0 2005f8c: 80 8a 20 ff btst 0xff, %o0 2005f90: 02 80 00 1b be 2005ffc 2005f94: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } if ( !_Timespec_Is_valid( &(value->it_interval) ) ) { 2005f98: 40 00 0f 44 call 2009ca8 <_Timespec_Is_valid> 2005f9c: 90 10 00 1a mov %i2, %o0 2005fa0: 80 8a 20 ff btst 0xff, %o0 2005fa4: 02 80 00 16 be 2005ffc <== NEVER TAKEN 2005fa8: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) { 2005fac: 80 a6 60 00 cmp %i1, 0 2005fb0: 02 80 00 05 be 2005fc4 2005fb4: 90 07 bf e4 add %fp, -28, %o0 2005fb8: 80 a6 60 04 cmp %i1, 4 2005fbc: 12 80 00 10 bne 2005ffc 2005fc0: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } normalize = *value; 2005fc4: 92 10 00 1a mov %i2, %o1 2005fc8: 40 00 26 e3 call 200fb54 2005fcc: 94 10 20 10 mov 0x10, %o2 /* Convert absolute to relative time */ if (flags == TIMER_ABSTIME) { 2005fd0: 80 a6 60 04 cmp %i1, 4 2005fd4: 12 80 00 14 bne 2006024 2005fd8: 92 10 00 18 mov %i0, %o1 struct timespec now; _TOD_Get( &now ); 2005fdc: 40 00 06 2a call 2007884 <_TOD_Get> 2005fe0: 90 07 bf f4 add %fp, -12, %o0 /* Check for seconds in the past */ if ( _Timespec_Greater_than( &now, &normalize.it_value ) ) 2005fe4: 90 07 bf f4 add %fp, -12, %o0 2005fe8: 40 00 0f 20 call 2009c68 <_Timespec_Greater_than> 2005fec: 92 07 bf ec add %fp, -20, %o1 2005ff0: 80 8a 20 ff btst 0xff, %o0 2005ff4: 02 80 00 08 be 2006014 2005ff8: 92 07 bf ec add %fp, -20, %o1 rtems_set_errno_and_return_minus_one( EINVAL ); 2005ffc: 40 00 24 7a call 200f1e4 <__errno> 2006000: b0 10 3f ff mov -1, %i0 2006004: 82 10 20 16 mov 0x16, %g1 2006008: c2 22 00 00 st %g1, [ %o0 ] 200600c: 81 c7 e0 08 ret 2006010: 81 e8 00 00 restore _Timespec_Subtract( &now, &normalize.it_value, &normalize.it_value ); 2006014: 90 07 bf f4 add %fp, -12, %o0 2006018: 40 00 0f 35 call 2009cec <_Timespec_Subtract> 200601c: 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 *) 2006020: 92 10 00 18 mov %i0, %o1 2006024: 11 00 80 75 sethi %hi(0x201d400), %o0 2006028: 94 07 bf fc add %fp, -4, %o2 200602c: 40 00 08 c5 call 2008340 <_Objects_Get> 2006030: 90 12 22 60 or %o0, 0x260, %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 ) { 2006034: c2 07 bf fc ld [ %fp + -4 ], %g1 2006038: 80 a0 60 00 cmp %g1, 0 200603c: 12 80 00 39 bne 2006120 2006040: 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 ) { 2006044: c2 07 bf ec ld [ %fp + -20 ], %g1 2006048: 80 a0 60 00 cmp %g1, 0 200604c: 12 80 00 14 bne 200609c 2006050: c2 07 bf f0 ld [ %fp + -16 ], %g1 2006054: 80 a0 60 00 cmp %g1, 0 2006058: 12 80 00 11 bne 200609c 200605c: 01 00 00 00 nop /* Stop the timer */ (void) _Watchdog_Remove( &ptimer->Timer ); 2006060: 40 00 10 56 call 200a1b8 <_Watchdog_Remove> 2006064: 90 02 20 10 add %o0, 0x10, %o0 /* The old data of the timer are returned */ if ( ovalue ) 2006068: 80 a6 e0 00 cmp %i3, 0 200606c: 02 80 00 05 be 2006080 2006070: 90 10 00 1b mov %i3, %o0 *ovalue = ptimer->timer_data; 2006074: 92 06 20 54 add %i0, 0x54, %o1 2006078: 40 00 26 b7 call 200fb54 200607c: 94 10 20 10 mov 0x10, %o2 /* The new data are set */ ptimer->timer_data = normalize; 2006080: 90 06 20 54 add %i0, 0x54, %o0 2006084: 92 07 bf e4 add %fp, -28, %o1 2006088: 40 00 26 b3 call 200fb54 200608c: 94 10 20 10 mov 0x10, %o2 /* Indicates that the timer is created and stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; 2006090: 82 10 20 04 mov 4, %g1 2006094: 10 80 00 1f b 2006110 2006098: 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 ); 200609c: 40 00 0f 25 call 2009d30 <_Timespec_To_ticks> 20060a0: 90 10 00 1a mov %i2, %o0 20060a4: d0 26 20 64 st %o0, [ %i0 + 0x64 ] initial_period = _Timespec_To_ticks( &normalize.it_value ); 20060a8: 40 00 0f 22 call 2009d30 <_Timespec_To_ticks> 20060ac: 90 07 bf ec add %fp, -20, %o0 activated = _POSIX_Timer_Insert_helper( 20060b0: 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 ); 20060b4: 92 10 00 08 mov %o0, %o1 activated = _POSIX_Timer_Insert_helper( 20060b8: 17 00 80 18 sethi %hi(0x2006000), %o3 20060bc: 90 06 20 10 add %i0, 0x10, %o0 20060c0: 96 12 e1 38 or %o3, 0x138, %o3 20060c4: 40 00 19 9e call 200c73c <_POSIX_Timer_Insert_helper> 20060c8: 98 10 00 18 mov %i0, %o4 initial_period, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) { 20060cc: 80 8a 20 ff btst 0xff, %o0 20060d0: 02 80 00 10 be 2006110 20060d4: 01 00 00 00 nop /* * The timer has been started and is running. So we return the * old ones in "ovalue" */ if ( ovalue ) 20060d8: 80 a6 e0 00 cmp %i3, 0 20060dc: 02 80 00 05 be 20060f0 20060e0: 90 10 00 1b mov %i3, %o0 *ovalue = ptimer->timer_data; 20060e4: 92 06 20 54 add %i0, 0x54, %o1 20060e8: 40 00 26 9b call 200fb54 20060ec: 94 10 20 10 mov 0x10, %o2 ptimer->timer_data = normalize; 20060f0: 90 06 20 54 add %i0, 0x54, %o0 20060f4: 92 07 bf e4 add %fp, -28, %o1 20060f8: 40 00 26 97 call 200fb54 20060fc: 94 10 20 10 mov 0x10, %o2 /* Indicate that the time is running */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 2006100: 82 10 20 03 mov 3, %g1 _TOD_Get( &ptimer->time ); 2006104: 90 06 20 6c add %i0, 0x6c, %o0 2006108: 40 00 05 df call 2007884 <_TOD_Get> 200610c: c2 2e 20 3c stb %g1, [ %i0 + 0x3c ] _Thread_Enable_dispatch(); 2006110: 40 00 0c 1d call 2009184 <_Thread_Enable_dispatch> 2006114: b0 10 20 00 clr %i0 return 0; 2006118: 81 c7 e0 08 ret 200611c: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EINVAL ); 2006120: 40 00 24 31 call 200f1e4 <__errno> 2006124: b0 10 3f ff mov -1, %i0 2006128: 82 10 20 16 mov 0x16, %g1 200612c: c2 22 00 00 st %g1, [ %o0 ] } 2006130: 81 c7 e0 08 ret 2006134: 81 e8 00 00 restore =============================================================================== 02005dbc : useconds_t ualarm( useconds_t useconds, useconds_t interval ) { 2005dbc: 9d e3 bf 98 save %sp, -104, %sp /* * Initialize the timer used to implement alarm(). */ if ( !the_timer->routine ) { 2005dc0: 39 00 80 61 sethi %hi(0x2018400), %i4 2005dc4: b8 17 22 d8 or %i4, 0x2d8, %i4 ! 20186d8 <_POSIX_signals_Ualarm_timer> 2005dc8: c2 07 20 1c ld [ %i4 + 0x1c ], %g1 2005dcc: 80 a0 60 00 cmp %g1, 0 2005dd0: 12 80 00 0a bne 2005df8 2005dd4: ba 10 00 18 mov %i0, %i5 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2005dd8: 03 00 80 17 sethi %hi(0x2005c00), %g1 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2005ddc: c0 27 20 08 clr [ %i4 + 8 ] the_watchdog->routine = routine; 2005de0: 82 10 61 90 or %g1, 0x190, %g1 the_watchdog->id = id; 2005de4: c0 27 20 20 clr [ %i4 + 0x20 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2005de8: c2 27 20 1c st %g1, [ %i4 + 0x1c ] the_watchdog->id = id; the_watchdog->user_data = user_data; 2005dec: c0 27 20 24 clr [ %i4 + 0x24 ] useconds_t ualarm( useconds_t useconds, useconds_t interval ) { useconds_t remaining = 0; 2005df0: 10 80 00 1b b 2005e5c 2005df4: 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 ); 2005df8: 40 00 0f e1 call 2009d7c <_Watchdog_Remove> 2005dfc: 90 10 00 1c mov %i4, %o0 if ( (state == WATCHDOG_ACTIVE) || (state == WATCHDOG_REMOVE_IT) ) { 2005e00: 90 02 3f fe add %o0, -2, %o0 2005e04: 80 a2 20 01 cmp %o0, 1 2005e08: 18 80 00 15 bgu 2005e5c <== NEVER TAKEN 2005e0c: 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); 2005e10: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2005e14: d0 07 20 14 ld [ %i4 + 0x14 ], %o0 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 2005e18: 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); 2005e1c: 90 02 00 01 add %o0, %g1, %o0 2005e20: c2 07 20 18 ld [ %i4 + 0x18 ], %g1 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 2005e24: 40 00 0e 67 call 20097c0 <_Timespec_From_ticks> 2005e28: 90 22 00 01 sub %o0, %g1, %o0 remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND; 2005e2c: c2 07 bf f8 ld [ %fp + -8 ], %g1 remaining += tp.tv_nsec / 1000; 2005e30: 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; 2005e34: b1 28 60 08 sll %g1, 8, %i0 2005e38: 85 28 60 03 sll %g1, 3, %g2 2005e3c: 84 26 00 02 sub %i0, %g2, %g2 remaining += tp.tv_nsec / 1000; 2005e40: 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; 2005e44: b1 28 a0 06 sll %g2, 6, %i0 2005e48: b0 26 00 02 sub %i0, %g2, %i0 remaining += tp.tv_nsec / 1000; 2005e4c: 40 00 37 1f call 2013ac8 <.div> 2005e50: 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; 2005e54: b1 2e 20 06 sll %i0, 6, %i0 remaining += tp.tv_nsec / 1000; 2005e58: 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 ) { 2005e5c: 80 a7 60 00 cmp %i5, 0 2005e60: 02 80 00 19 be 2005ec4 2005e64: 39 00 03 d0 sethi %hi(0xf4000), %i4 Watchdog_Interval ticks; tp.tv_sec = useconds / TOD_MICROSECONDS_PER_SECOND; 2005e68: 90 10 00 1d mov %i5, %o0 2005e6c: 40 00 37 15 call 2013ac0 <.udiv> 2005e70: 92 17 22 40 or %i4, 0x240, %o1 tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2005e74: 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; 2005e78: d0 27 bf f8 st %o0, [ %fp + -8 ] tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2005e7c: 40 00 37 bd call 2013d70 <.urem> 2005e80: 90 10 00 1d mov %i5, %o0 2005e84: 85 2a 20 07 sll %o0, 7, %g2 2005e88: 83 2a 20 02 sll %o0, 2, %g1 2005e8c: 82 20 80 01 sub %g2, %g1, %g1 2005e90: 90 00 40 08 add %g1, %o0, %o0 2005e94: 91 2a 20 03 sll %o0, 3, %o0 2005e98: d0 27 bf fc st %o0, [ %fp + -4 ] ticks = _Timespec_To_ticks( &tp ); 2005e9c: 40 00 0e 6f call 2009858 <_Timespec_To_ticks> 2005ea0: 90 07 bf f8 add %fp, -8, %o0 if ( ticks == 0 ) ticks = 1; _Watchdog_Insert_ticks( the_timer, _Timespec_To_ticks( &tp ) ); 2005ea4: 40 00 0e 6d call 2009858 <_Timespec_To_ticks> 2005ea8: 90 07 bf f8 add %fp, -8, %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2005eac: 13 00 80 61 sethi %hi(0x2018400), %o1 2005eb0: 92 12 62 d8 or %o1, 0x2d8, %o1 ! 20186d8 <_POSIX_signals_Ualarm_timer> 2005eb4: d0 22 60 0c st %o0, [ %o1 + 0xc ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2005eb8: 11 00 80 5f sethi %hi(0x2017c00), %o0 2005ebc: 40 00 0f 56 call 2009c14 <_Watchdog_Insert> 2005ec0: 90 12 22 8c or %o0, 0x28c, %o0 ! 2017e8c <_Watchdog_Ticks_chain> } return remaining; } 2005ec4: 81 c7 e0 08 ret 2005ec8: 81 e8 00 00 restore