=============================================================================== 02009094 <_CORE_RWLock_Release>: */ CORE_RWLock_Status _CORE_RWLock_Release( CORE_RWLock_Control *the_rwlock ) { 2009094: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Thread_Control *executing = _Thread_Executing; 2009098: 03 00 80 67 sethi %hi(0x2019c00), %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 ); 200909c: 7f ff e9 74 call 200366c 20090a0: fa 00 63 b4 ld [ %g1 + 0x3b4 ], %i5 ! 2019fb4 <_Per_CPU_Information+0xc> 20090a4: 84 10 00 08 mov %o0, %g2 if ( the_rwlock->current_state == CORE_RWLOCK_UNLOCKED){ 20090a8: c2 06 20 44 ld [ %i0 + 0x44 ], %g1 20090ac: 80 a0 60 00 cmp %g1, 0 20090b0: 12 80 00 08 bne 20090d0 <_CORE_RWLock_Release+0x3c> 20090b4: 80 a0 60 01 cmp %g1, 1 _ISR_Enable( level ); 20090b8: 7f ff e9 71 call 200367c 20090bc: b0 10 20 00 clr %i0 executing->Wait.return_code = CORE_RWLOCK_UNAVAILABLE; 20090c0: 82 10 20 02 mov 2, %g1 20090c4: c2 27 60 34 st %g1, [ %i5 + 0x34 ] 20090c8: 81 c7 e0 08 ret 20090cc: 81 e8 00 00 restore return CORE_RWLOCK_SUCCESSFUL; } if ( the_rwlock->current_state == CORE_RWLOCK_LOCKED_FOR_READING ) { 20090d0: 32 80 00 0b bne,a 20090fc <_CORE_RWLock_Release+0x68> 20090d4: c0 27 60 34 clr [ %i5 + 0x34 ] the_rwlock->number_of_readers -= 1; 20090d8: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 20090dc: 82 00 7f ff add %g1, -1, %g1 if ( the_rwlock->number_of_readers != 0 ) { 20090e0: 80 a0 60 00 cmp %g1, 0 20090e4: 02 80 00 05 be 20090f8 <_CORE_RWLock_Release+0x64> 20090e8: c2 26 20 48 st %g1, [ %i0 + 0x48 ] /* must be unlocked again */ _ISR_Enable( level ); 20090ec: 7f ff e9 64 call 200367c 20090f0: b0 10 20 00 clr %i0 return CORE_RWLOCK_SUCCESSFUL; 20090f4: 30 80 00 24 b,a 2009184 <_CORE_RWLock_Release+0xf0> } } /* CORE_RWLOCK_LOCKED_FOR_WRITING or READING with readers */ executing->Wait.return_code = CORE_RWLOCK_SUCCESSFUL; 20090f8: 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; 20090fc: c0 26 20 44 clr [ %i0 + 0x44 ] _ISR_Enable( level ); 2009100: 7f ff e9 5f call 200367c 2009104: 90 10 00 02 mov %g2, %o0 next = _Thread_queue_Dequeue( &the_rwlock->Wait_queue ); 2009108: 40 00 07 4c call 200ae38 <_Thread_queue_Dequeue> 200910c: 90 10 00 18 mov %i0, %o0 if ( next ) { 2009110: 80 a2 20 00 cmp %o0, 0 2009114: 22 80 00 1c be,a 2009184 <_CORE_RWLock_Release+0xf0> 2009118: b0 10 20 00 clr %i0 if ( next->Wait.option == CORE_RWLOCK_THREAD_WAITING_FOR_WRITE ) { 200911c: c2 02 20 30 ld [ %o0 + 0x30 ], %g1 2009120: 80 a0 60 01 cmp %g1, 1 2009124: 32 80 00 05 bne,a 2009138 <_CORE_RWLock_Release+0xa4> 2009128: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_WRITING; 200912c: 82 10 20 02 mov 2, %g1 return CORE_RWLOCK_SUCCESSFUL; 2009130: 10 80 00 14 b 2009180 <_CORE_RWLock_Release+0xec> 2009134: c2 26 20 44 st %g1, [ %i0 + 0x44 ] } /* * Must be CORE_RWLOCK_THREAD_WAITING_FOR_READING */ the_rwlock->number_of_readers += 1; 2009138: 82 00 60 01 inc %g1 200913c: c2 26 20 48 st %g1, [ %i0 + 0x48 ] the_rwlock->current_state = CORE_RWLOCK_LOCKED_FOR_READING; 2009140: 82 10 20 01 mov 1, %g1 2009144: 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 ); 2009148: 40 00 08 78 call 200b328 <_Thread_queue_First> 200914c: 90 10 00 18 mov %i0, %o0 if ( !next || 2009150: 92 92 20 00 orcc %o0, 0, %o1 2009154: 22 80 00 0c be,a 2009184 <_CORE_RWLock_Release+0xf0> 2009158: b0 10 20 00 clr %i0 200915c: c2 02 60 30 ld [ %o1 + 0x30 ], %g1 2009160: 80 a0 60 01 cmp %g1, 1 2009164: 02 80 00 07 be 2009180 <_CORE_RWLock_Release+0xec> <== NEVER TAKEN 2009168: 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; 200916c: c2 06 20 48 ld [ %i0 + 0x48 ], %g1 2009170: 82 00 60 01 inc %g1 _Thread_queue_Extract( &the_rwlock->Wait_queue, next ); 2009174: 40 00 08 1e call 200b1ec <_Thread_queue_Extract> 2009178: c2 26 20 48 st %g1, [ %i0 + 0x48 ] } 200917c: 30 bf ff f3 b,a 2009148 <_CORE_RWLock_Release+0xb4> } /* indentation is to match _ISR_Disable at top */ return CORE_RWLOCK_SUCCESSFUL; } 2009180: b0 10 20 00 clr %i0 2009184: 81 c7 e0 08 ret 2009188: 81 e8 00 00 restore =============================================================================== 0200918c <_CORE_RWLock_Timeout>: void _CORE_RWLock_Timeout( Objects_Id id, void *ignored ) { 200918c: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 2009190: 90 10 00 18 mov %i0, %o0 2009194: 40 00 06 59 call 200aaf8 <_Thread_Get> 2009198: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200919c: c2 07 bf fc ld [ %fp + -4 ], %g1 20091a0: 80 a0 60 00 cmp %g1, 0 20091a4: 12 80 00 09 bne 20091c8 <_CORE_RWLock_Timeout+0x3c> <== NEVER TAKEN 20091a8: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 20091ac: 40 00 08 9d call 200b420 <_Thread_queue_Process_timeout> 20091b0: 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--; 20091b4: 03 00 80 66 sethi %hi(0x2019800), %g1 20091b8: c4 00 62 70 ld [ %g1 + 0x270 ], %g2 ! 2019a70 <_Thread_Dispatch_disable_level> 20091bc: 84 00 bf ff add %g2, -1, %g2 20091c0: c4 20 62 70 st %g2, [ %g1 + 0x270 ] return _Thread_Dispatch_disable_level; 20091c4: c2 00 62 70 ld [ %g1 + 0x270 ], %g1 20091c8: 81 c7 e0 08 ret 20091cc: 81 e8 00 00 restore =============================================================================== 0200fbe0 <_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 ) { 200fbe0: 9d e3 bf a0 save %sp, -96, %sp size_t message_buffering_required; size_t allocated_message_size; the_message_queue->maximum_pending_messages = maximum_pending_messages; 200fbe4: f4 26 20 44 st %i2, [ %i0 + 0x44 ] the_message_queue->number_of_pending_messages = 0; 200fbe8: c0 26 20 48 clr [ %i0 + 0x48 ] the_message_queue->maximum_message_size = maximum_message_size; 200fbec: 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; 200fbf0: c0 26 20 60 clr [ %i0 + 0x60 ] the_message_queue->notify_argument = the_argument; 200fbf4: 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)) { 200fbf8: 80 8e e0 03 btst 3, %i3 200fbfc: 02 80 00 07 be 200fc18 <_CORE_message_queue_Initialize+0x38> 200fc00: b8 10 00 1b mov %i3, %i4 allocated_message_size += sizeof(uint32_t); 200fc04: b8 06 e0 04 add %i3, 4, %i4 allocated_message_size &= ~(sizeof(uint32_t) - 1); 200fc08: b8 0f 3f fc and %i4, -4, %i4 } if (allocated_message_size < maximum_message_size) 200fc0c: 80 a7 00 1b cmp %i4, %i3 200fc10: 0a 80 00 22 bcs 200fc98 <_CORE_message_queue_Initialize+0xb8><== NEVER TAKEN 200fc14: a0 10 20 00 clr %l0 /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ message_buffering_required = (size_t) maximum_pending_messages * (allocated_message_size + sizeof(CORE_message_queue_Buffer_control)); 200fc18: ba 07 20 14 add %i4, 0x14, %i5 /* * Calculate how much total memory is required for message buffering and * check for overflow on the multiplication. */ message_buffering_required = (size_t) maximum_pending_messages * 200fc1c: 92 10 00 1a mov %i2, %o1 200fc20: 90 10 00 1d mov %i5, %o0 200fc24: 40 00 41 23 call 20200b0 <.umul> 200fc28: a0 10 20 00 clr %l0 (allocated_message_size + sizeof(CORE_message_queue_Buffer_control)); if (message_buffering_required < allocated_message_size) 200fc2c: 80 a2 00 1c cmp %o0, %i4 200fc30: 2a 80 00 1b bcs,a 200fc9c <_CORE_message_queue_Initialize+0xbc><== NEVER TAKEN 200fc34: b0 0c 20 01 and %l0, 1, %i0 <== NOT EXECUTED /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) _Workspace_Allocate( message_buffering_required ); 200fc38: 40 00 0c 4d call 2012d6c <_Workspace_Allocate> 200fc3c: 01 00 00 00 nop return false; /* * Attempt to allocate the message memory */ the_message_queue->message_buffers = (CORE_message_queue_Buffer *) 200fc40: d0 26 20 5c st %o0, [ %i0 + 0x5c ] _Workspace_Allocate( message_buffering_required ); if (the_message_queue->message_buffers == 0) 200fc44: 80 a2 20 00 cmp %o0, 0 200fc48: 02 80 00 14 be 200fc98 <_CORE_message_queue_Initialize+0xb8> 200fc4c: 92 10 00 08 mov %o0, %o1 /* * Initialize the pool of inactive messages, pending messages, * and set of waiting threads. */ _Chain_Initialize ( 200fc50: 90 06 20 68 add %i0, 0x68, %o0 200fc54: 94 10 00 1a mov %i2, %o2 200fc58: 40 00 16 1f call 20154d4 <_Chain_Initialize> 200fc5c: 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 ); 200fc60: 82 06 20 50 add %i0, 0x50, %g1 head->next = tail; head->previous = NULL; tail->previous = head; 200fc64: 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( 200fc68: 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 ); 200fc6c: 84 06 20 54 add %i0, 0x54, %g2 200fc70: 82 18 60 01 xor %g1, 1, %g1 200fc74: 80 a0 00 01 cmp %g0, %g1 head->next = tail; 200fc78: c4 26 20 50 st %g2, [ %i0 + 0x50 ] head->previous = NULL; 200fc7c: c0 26 20 54 clr [ %i0 + 0x54 ] 200fc80: 90 10 00 18 mov %i0, %o0 200fc84: 92 60 3f ff subx %g0, -1, %o1 200fc88: 94 10 20 80 mov 0x80, %o2 200fc8c: 96 10 20 06 mov 6, %o3 200fc90: 40 00 09 b1 call 2012354 <_Thread_queue_Initialize> 200fc94: a0 10 20 01 mov 1, %l0 STATES_WAITING_FOR_MESSAGE, CORE_MESSAGE_QUEUE_STATUS_TIMEOUT ); return true; } 200fc98: b0 0c 20 01 and %l0, 1, %i0 200fc9c: 81 c7 e0 08 ret 200fca0: 81 e8 00 00 restore =============================================================================== 02006ff4 <_CORE_mutex_Seize>: Objects_Id _id, bool _wait, Watchdog_Interval _timeout, ISR_Level _level ) { 2006ff4: 9d e3 bf a0 save %sp, -96, %sp * This routine returns true if thread dispatch indicates * that we are in a critical section. */ RTEMS_INLINE_ROUTINE bool _Thread_Dispatch_in_critical_section(void) { if ( _Thread_Dispatch_disable_level == 0 ) 2006ff8: 03 00 80 72 sethi %hi(0x201c800), %g1 2006ffc: c2 00 61 00 ld [ %g1 + 0x100 ], %g1 ! 201c900 <_Thread_Dispatch_disable_level> 2007000: 80 a0 60 00 cmp %g1, 0 2007004: 02 80 00 0c be 2007034 <_CORE_mutex_Seize+0x40> 2007008: f8 27 a0 54 st %i4, [ %fp + 0x54 ] _CORE_mutex_Seize_body( _the_mutex, _id, _wait, _timeout, _level ); 200700c: 10 80 00 2b b 20070b8 <_CORE_mutex_Seize+0xc4> 2007010: 80 a6 a0 00 cmp %i2, 0 2007014: c2 00 62 5c ld [ %g1 + 0x25c ], %g1 2007018: 80 a0 60 01 cmp %g1, 1 200701c: 08 80 00 07 bleu 2007038 <_CORE_mutex_Seize+0x44> 2007020: 90 10 00 18 mov %i0, %o0 2007024: 90 10 20 00 clr %o0 2007028: 92 10 20 00 clr %o1 200702c: 40 00 01 e1 call 20077b0 <_Internal_error_Occurred> 2007030: 94 10 20 12 mov 0x12, %o2 2007034: 90 10 00 18 mov %i0, %o0 2007038: 40 00 15 3c call 200c528 <_CORE_mutex_Seize_interrupt_trylock> 200703c: 92 07 a0 54 add %fp, 0x54, %o1 2007040: 80 a2 20 00 cmp %o0, 0 2007044: 02 80 00 0a be 200706c <_CORE_mutex_Seize+0x78> 2007048: 80 a6 a0 00 cmp %i2, 0 200704c: 12 80 00 0a bne 2007074 <_CORE_mutex_Seize+0x80> 2007050: 82 10 20 01 mov 1, %g1 2007054: 7f ff ec 32 call 200211c 2007058: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 200705c: 03 00 80 73 sethi %hi(0x201cc00), %g1 2007060: c2 00 62 44 ld [ %g1 + 0x244 ], %g1 ! 201ce44 <_Per_CPU_Information+0xc> 2007064: 84 10 20 01 mov 1, %g2 2007068: c4 20 60 34 st %g2, [ %g1 + 0x34 ] 200706c: 81 c7 e0 08 ret 2007070: 81 e8 00 00 restore 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; 2007074: c2 26 20 30 st %g1, [ %i0 + 0x30 ] 2007078: 03 00 80 73 sethi %hi(0x201cc00), %g1 200707c: c2 00 62 44 ld [ %g1 + 0x244 ], %g1 ! 201ce44 <_Per_CPU_Information+0xc> 2007080: f0 20 60 44 st %i0, [ %g1 + 0x44 ] 2007084: f2 20 60 20 st %i1, [ %g1 + 0x20 ] /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 2007088: 03 00 80 72 sethi %hi(0x201c800), %g1 200708c: c4 00 61 00 ld [ %g1 + 0x100 ], %g2 ! 201c900 <_Thread_Dispatch_disable_level> 2007090: 84 00 a0 01 inc %g2 2007094: c4 20 61 00 st %g2, [ %g1 + 0x100 ] return _Thread_Dispatch_disable_level; 2007098: c2 00 61 00 ld [ %g1 + 0x100 ], %g1 200709c: 7f ff ec 20 call 200211c 20070a0: d0 07 a0 54 ld [ %fp + 0x54 ], %o0 20070a4: 90 10 00 18 mov %i0, %o0 20070a8: 7f ff ff bb call 2006f94 <_CORE_mutex_Seize_interrupt_blocking> 20070ac: 92 10 00 1b mov %i3, %o1 20070b0: 81 c7 e0 08 ret 20070b4: 81 e8 00 00 restore 20070b8: 12 bf ff d7 bne 2007014 <_CORE_mutex_Seize+0x20> <== ALWAYS TAKEN 20070bc: 03 00 80 72 sethi %hi(0x201c800), %g1 20070c0: 10 bf ff de b 2007038 <_CORE_mutex_Seize+0x44> <== NOT EXECUTED 20070c4: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED =============================================================================== 0200723c <_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 ) { 200723c: 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)) ) { 2007240: 90 10 00 18 mov %i0, %o0 2007244: 40 00 07 29 call 2008ee8 <_Thread_queue_Dequeue> 2007248: ba 10 00 18 mov %i0, %i5 200724c: 80 a2 20 00 cmp %o0, 0 2007250: 12 80 00 0e bne 2007288 <_CORE_semaphore_Surrender+0x4c> 2007254: 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 ); 2007258: 7f ff eb ad call 200210c 200725c: 01 00 00 00 nop if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) 2007260: c2 07 60 48 ld [ %i5 + 0x48 ], %g1 2007264: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 2007268: 80 a0 40 02 cmp %g1, %g2 200726c: 1a 80 00 05 bcc 2007280 <_CORE_semaphore_Surrender+0x44> <== NEVER TAKEN 2007270: b0 10 20 04 mov 4, %i0 the_semaphore->count += 1; 2007274: 82 00 60 01 inc %g1 { Thread_Control *the_thread; ISR_Level level; CORE_semaphore_Status status; status = CORE_SEMAPHORE_STATUS_SUCCESSFUL; 2007278: b0 10 20 00 clr %i0 #endif } else { _ISR_Disable( level ); if ( the_semaphore->count < the_semaphore->Attributes.maximum_count ) the_semaphore->count += 1; 200727c: c2 27 60 48 st %g1, [ %i5 + 0x48 ] else status = CORE_SEMAPHORE_MAXIMUM_COUNT_EXCEEDED; _ISR_Enable( level ); 2007280: 7f ff eb a7 call 200211c 2007284: 01 00 00 00 nop } return status; } 2007288: 81 c7 e0 08 ret 200728c: 81 e8 00 00 restore =============================================================================== 02005f80 <_Event_Surrender>: */ void _Event_Surrender( Thread_Control *the_thread ) { 2005f80: 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 ]; 2005f84: f8 06 21 58 ld [ %i0 + 0x158 ], %i4 option_set = (rtems_option) the_thread->Wait.option; 2005f88: f6 06 20 30 ld [ %i0 + 0x30 ], %i3 _ISR_Disable( level ); 2005f8c: 7f ff f0 60 call 200210c 2005f90: ba 10 00 18 mov %i0, %i5 2005f94: b0 10 00 08 mov %o0, %i0 pending_events = api->pending_events; 2005f98: c4 07 00 00 ld [ %i4 ], %g2 event_condition = (rtems_event_set) the_thread->Wait.count; 2005f9c: 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 ) ) { 2005fa0: 82 88 c0 02 andcc %g3, %g2, %g1 2005fa4: 02 80 00 43 be 20060b0 <_Event_Surrender+0x130> 2005fa8: 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() && 2005fac: 09 00 80 73 sethi %hi(0x201cc00), %g4 2005fb0: 88 11 22 38 or %g4, 0x238, %g4 ! 201ce38 <_Per_CPU_Information> 2005fb4: f2 01 20 08 ld [ %g4 + 8 ], %i1 2005fb8: 80 a6 60 00 cmp %i1, 0 2005fbc: 22 80 00 1d be,a 2006030 <_Event_Surrender+0xb0> 2005fc0: c8 07 60 10 ld [ %i5 + 0x10 ], %g4 2005fc4: c8 01 20 0c ld [ %g4 + 0xc ], %g4 2005fc8: 80 a7 40 04 cmp %i5, %g4 2005fcc: 32 80 00 19 bne,a 2006030 <_Event_Surrender+0xb0> 2005fd0: c8 07 60 10 ld [ %i5 + 0x10 ], %g4 _Thread_Is_executing( the_thread ) && ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || 2005fd4: 09 00 80 74 sethi %hi(0x201d000), %g4 2005fd8: f2 01 22 30 ld [ %g4 + 0x230 ], %i1 ! 201d230 <_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 ) && 2005fdc: 80 a6 60 02 cmp %i1, 2 2005fe0: 02 80 00 07 be 2005ffc <_Event_Surrender+0x7c> <== NEVER TAKEN 2005fe4: 80 a0 40 03 cmp %g1, %g3 ((_Event_Sync_state == THREAD_BLOCKING_OPERATION_TIMEOUT) || (_Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED)) ) { 2005fe8: c8 01 22 30 ld [ %g4 + 0x230 ], %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) || 2005fec: 80 a1 20 01 cmp %g4, 1 2005ff0: 32 80 00 10 bne,a 2006030 <_Event_Surrender+0xb0> 2005ff4: 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) ) { 2005ff8: 80 a0 40 03 cmp %g1, %g3 2005ffc: 02 80 00 04 be 200600c <_Event_Surrender+0x8c> 2006000: 80 8e e0 02 btst 2, %i3 2006004: 02 80 00 2b be 20060b0 <_Event_Surrender+0x130> <== NEVER TAKEN 2006008: 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) ); 200600c: 84 28 80 01 andn %g2, %g1, %g2 api->pending_events = _Event_sets_Clear( pending_events,seized_events ); 2006010: c4 27 00 00 st %g2, [ %i4 ] the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2006014: 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; 2006018: c0 27 60 24 clr [ %i5 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 200601c: c2 20 80 00 st %g1, [ %g2 ] _Event_Sync_state = THREAD_BLOCKING_OPERATION_SATISFIED; 2006020: 84 10 20 03 mov 3, %g2 2006024: 03 00 80 74 sethi %hi(0x201d000), %g1 2006028: c4 20 62 30 st %g2, [ %g1 + 0x230 ] ! 201d230 <_Event_Sync_state> 200602c: 30 80 00 21 b,a 20060b0 <_Event_Surrender+0x130> } /* * Otherwise, this is a normal send to another thread */ if ( _States_Is_waiting_for_event( the_thread->current_state ) ) { 2006030: 80 89 21 00 btst 0x100, %g4 2006034: 02 80 00 1f be 20060b0 <_Event_Surrender+0x130> 2006038: 80 a0 40 03 cmp %g1, %g3 if ( seized_events == event_condition || _Options_Is_any( option_set ) ) { 200603c: 02 80 00 04 be 200604c <_Event_Surrender+0xcc> 2006040: 80 8e e0 02 btst 2, %i3 2006044: 02 80 00 1b be 20060b0 <_Event_Surrender+0x130> <== NEVER TAKEN 2006048: 01 00 00 00 nop 200604c: 84 28 80 01 andn %g2, %g1, %g2 api->pending_events = _Event_sets_Clear( pending_events, seized_events ); 2006050: c4 27 00 00 st %g2, [ %i4 ] the_thread->Wait.count = 0; *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 2006054: 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; 2006058: c0 27 60 24 clr [ %i5 + 0x24 ] *(rtems_event_set *)the_thread->Wait.return_argument = seized_events; 200605c: c2 20 80 00 st %g1, [ %g2 ] _ISR_Flash( level ); 2006060: 7f ff f0 2f call 200211c 2006064: 90 10 00 18 mov %i0, %o0 2006068: 7f ff f0 29 call 200210c 200606c: 01 00 00 00 nop if ( !_Watchdog_Is_active( &the_thread->Timer ) ) { 2006070: c2 07 60 50 ld [ %i5 + 0x50 ], %g1 2006074: 80 a0 60 02 cmp %g1, 2 2006078: 02 80 00 06 be 2006090 <_Event_Surrender+0x110> 200607c: 82 10 20 03 mov 3, %g1 _ISR_Enable( level ); 2006080: 7f ff f0 27 call 200211c 2006084: 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 ); 2006088: 10 80 00 08 b 20060a8 <_Event_Surrender+0x128> 200608c: 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; 2006090: c2 27 60 50 st %g1, [ %i5 + 0x50 ] _Thread_Unblock( the_thread ); } else { _Watchdog_Deactivate( &the_thread->Timer ); _ISR_Enable( level ); 2006094: 7f ff f0 22 call 200211c 2006098: 33 04 00 ff sethi %hi(0x1003fc00), %i1 (void) _Watchdog_Remove( &the_thread->Timer ); 200609c: 40 00 0e b2 call 2009b64 <_Watchdog_Remove> 20060a0: 90 07 60 48 add %i5, 0x48, %o0 20060a4: b2 16 63 f8 or %i1, 0x3f8, %i1 20060a8: 40 00 09 d7 call 2008804 <_Thread_Clear_state> 20060ac: 91 e8 00 1d restore %g0, %i5, %o0 _Thread_Unblock( the_thread ); } return; } } _ISR_Enable( level ); 20060b0: 7f ff f0 1b call 200211c 20060b4: 81 e8 00 00 restore =============================================================================== 020060b8 <_Event_Timeout>: void _Event_Timeout( Objects_Id id, void *ignored ) { 20060b8: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; ISR_Level level; the_thread = _Thread_Get( id, &location ); 20060bc: 90 10 00 18 mov %i0, %o0 20060c0: 40 00 0a ba call 2008ba8 <_Thread_Get> 20060c4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20060c8: c2 07 bf fc ld [ %fp + -4 ], %g1 20060cc: 80 a0 60 00 cmp %g1, 0 20060d0: 12 80 00 1d bne 2006144 <_Event_Timeout+0x8c> <== NEVER TAKEN 20060d4: 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 ); 20060d8: 7f ff f0 0d call 200210c 20060dc: 01 00 00 00 nop RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 20060e0: 03 00 80 73 sethi %hi(0x201cc00), %g1 return; } #endif the_thread->Wait.count = 0; if ( _Thread_Is_executing( the_thread ) ) { 20060e4: c2 00 62 44 ld [ %g1 + 0x244 ], %g1 ! 201ce44 <_Per_CPU_Information+0xc> 20060e8: 80 a7 40 01 cmp %i5, %g1 20060ec: 12 80 00 09 bne 2006110 <_Event_Timeout+0x58> 20060f0: c0 27 60 24 clr [ %i5 + 0x24 ] if ( _Event_Sync_state == THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) 20060f4: 03 00 80 74 sethi %hi(0x201d000), %g1 20060f8: c4 00 62 30 ld [ %g1 + 0x230 ], %g2 ! 201d230 <_Event_Sync_state> 20060fc: 80 a0 a0 01 cmp %g2, 1 2006100: 32 80 00 05 bne,a 2006114 <_Event_Timeout+0x5c> 2006104: 82 10 20 06 mov 6, %g1 _Event_Sync_state = THREAD_BLOCKING_OPERATION_TIMEOUT; 2006108: 84 10 20 02 mov 2, %g2 200610c: c4 20 62 30 st %g2, [ %g1 + 0x230 ] } the_thread->Wait.return_code = RTEMS_TIMEOUT; 2006110: 82 10 20 06 mov 6, %g1 2006114: c2 27 60 34 st %g1, [ %i5 + 0x34 ] _ISR_Enable( level ); 2006118: 7f ff f0 01 call 200211c 200611c: 01 00 00 00 nop RTEMS_INLINE_ROUTINE void _Thread_Unblock ( Thread_Control *the_thread ) { _Thread_Clear_state( the_thread, STATES_BLOCKED ); 2006120: 90 10 00 1d mov %i5, %o0 2006124: 13 04 00 ff sethi %hi(0x1003fc00), %o1 2006128: 40 00 09 b7 call 2008804 <_Thread_Clear_state> 200612c: 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--; 2006130: 03 00 80 72 sethi %hi(0x201c800), %g1 2006134: c4 00 61 00 ld [ %g1 + 0x100 ], %g2 ! 201c900 <_Thread_Dispatch_disable_level> 2006138: 84 00 bf ff add %g2, -1, %g2 200613c: c4 20 61 00 st %g2, [ %g1 + 0x100 ] return _Thread_Dispatch_disable_level; 2006140: c2 00 61 00 ld [ %g1 + 0x100 ], %g1 2006144: 81 c7 e0 08 ret 2006148: 81 e8 00 00 restore =============================================================================== 0200c694 <_Heap_Extend>: Heap_Control *heap, void *extend_area_begin_ptr, uintptr_t extend_area_size, uintptr_t *extended_size_ptr ) { 200c694: 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; 200c698: c0 27 bf f8 clr [ %fp + -8 ] Heap_Block *extend_last_block = NULL; 200c69c: 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; 200c6a0: 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; 200c6a4: 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; 200c6a8: e2 06 20 10 ld [ %i0 + 0x10 ], %l1 uintptr_t const min_block_size = heap->min_block_size; 200c6ac: 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; 200c6b0: 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 ) { 200c6b4: 80 a7 40 19 cmp %i5, %i1 200c6b8: 0a 80 00 9f bcs 200c934 <_Heap_Extend+0x2a0> 200c6bc: b8 10 20 00 clr %i4 return false; } extend_area_ok = _Heap_Get_first_and_last_block( 200c6c0: 90 10 00 19 mov %i1, %o0 200c6c4: 92 10 00 1a mov %i2, %o1 200c6c8: 94 10 00 11 mov %l1, %o2 200c6cc: 98 07 bf f8 add %fp, -8, %o4 200c6d0: 7f ff eb 34 call 20073a0 <_Heap_Get_first_and_last_block> 200c6d4: 9a 07 bf fc add %fp, -4, %o5 page_size, min_block_size, &extend_first_block, &extend_last_block ); if (!extend_area_ok ) { 200c6d8: 80 8a 20 ff btst 0xff, %o0 200c6dc: 02 80 00 96 be 200c934 <_Heap_Extend+0x2a0> 200c6e0: b4 10 00 10 mov %l0, %i2 200c6e4: aa 10 20 00 clr %l5 200c6e8: ac 10 20 00 clr %l6 200c6ec: b8 10 20 00 clr %i4 200c6f0: a8 10 20 00 clr %l4 200c6f4: 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 ( 200c6f8: 80 a0 40 1d cmp %g1, %i5 200c6fc: 1a 80 00 05 bcc 200c710 <_Heap_Extend+0x7c> 200c700: e6 06 80 00 ld [ %i2 ], %l3 200c704: 80 a6 40 13 cmp %i1, %l3 200c708: 2a 80 00 8b bcs,a 200c934 <_Heap_Extend+0x2a0> 200c70c: 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 ) { 200c710: 80 a7 40 01 cmp %i5, %g1 200c714: 02 80 00 06 be 200c72c <_Heap_Extend+0x98> 200c718: 80 a7 40 13 cmp %i5, %l3 merge_below_block = start_block; } else if ( extend_area_end < sub_area_end ) { 200c71c: 2a 80 00 05 bcs,a 200c730 <_Heap_Extend+0x9c> 200c720: ac 10 00 1a mov %i2, %l6 200c724: 10 80 00 04 b 200c734 <_Heap_Extend+0xa0> 200c728: 90 10 00 13 mov %l3, %o0 200c72c: a8 10 00 1a mov %i2, %l4 200c730: 90 10 00 13 mov %l3, %o0 200c734: 40 00 17 37 call 2012410 <.urem> 200c738: 92 10 00 11 mov %l1, %o1 200c73c: ae 04 ff f8 add %l3, -8, %l7 link_below_block = start_block; } if ( sub_area_end == extend_area_begin ) { 200c740: 80 a4 c0 19 cmp %l3, %i1 200c744: 12 80 00 05 bne 200c758 <_Heap_Extend+0xc4> 200c748: 90 25 c0 08 sub %l7, %o0, %o0 start_block->prev_size = extend_area_end; 200c74c: 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 ) 200c750: 10 80 00 04 b 200c760 <_Heap_Extend+0xcc> 200c754: b8 10 00 08 mov %o0, %i4 merge_above_block = end_block; } else if ( sub_area_end < extend_area_begin ) { 200c758: 2a 80 00 02 bcs,a 200c760 <_Heap_Extend+0xcc> 200c75c: 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; 200c760: f4 02 20 04 ld [ %o0 + 4 ], %i2 200c764: 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); 200c768: 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 ); 200c76c: 80 a6 80 10 cmp %i2, %l0 200c770: 12 bf ff e2 bne 200c6f8 <_Heap_Extend+0x64> 200c774: 82 10 00 1a mov %i2, %g1 if ( extend_area_begin < heap->area_begin ) { 200c778: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200c77c: 80 a6 40 01 cmp %i1, %g1 200c780: 3a 80 00 04 bcc,a 200c790 <_Heap_Extend+0xfc> 200c784: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 heap->area_begin = extend_area_begin; 200c788: 10 80 00 05 b 200c79c <_Heap_Extend+0x108> 200c78c: f2 26 20 18 st %i1, [ %i0 + 0x18 ] } else if ( heap->area_end < extend_area_end ) { 200c790: 80 a0 40 1d cmp %g1, %i5 200c794: 2a 80 00 02 bcs,a 200c79c <_Heap_Extend+0x108> 200c798: 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; 200c79c: c4 07 bf f8 ld [ %fp + -8 ], %g2 200c7a0: c2 07 bf fc ld [ %fp + -4 ], %g1 extend_first_block->prev_size = extend_area_end; 200c7a4: 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 = 200c7a8: 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; 200c7ac: 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; 200c7b0: 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 = 200c7b4: 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 ) { 200c7b8: c6 06 20 20 ld [ %i0 + 0x20 ], %g3 200c7bc: 80 a0 c0 02 cmp %g3, %g2 200c7c0: 08 80 00 04 bleu 200c7d0 <_Heap_Extend+0x13c> 200c7c4: c0 20 60 04 clr [ %g1 + 4 ] heap->first_block = extend_first_block; 200c7c8: 10 80 00 06 b 200c7e0 <_Heap_Extend+0x14c> 200c7cc: c4 26 20 20 st %g2, [ %i0 + 0x20 ] } else if ( (uintptr_t) extend_last_block > (uintptr_t) heap->last_block ) { 200c7d0: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 200c7d4: 80 a0 80 01 cmp %g2, %g1 200c7d8: 2a 80 00 02 bcs,a 200c7e0 <_Heap_Extend+0x14c> 200c7dc: c2 26 20 24 st %g1, [ %i0 + 0x24 ] heap->last_block = extend_last_block; } if ( merge_below_block != NULL ) { 200c7e0: 80 a5 20 00 cmp %l4, 0 200c7e4: 02 80 00 14 be 200c834 <_Heap_Extend+0x1a0> 200c7e8: 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; 200c7ec: 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; 200c7f0: 92 10 00 1a mov %i2, %o1 200c7f4: 40 00 17 07 call 2012410 <.urem> 200c7f8: 90 10 00 19 mov %i1, %o0 if ( remainder != 0 ) { 200c7fc: 80 a2 20 00 cmp %o0, 0 200c800: 02 80 00 04 be 200c810 <_Heap_Extend+0x17c> 200c804: c2 05 00 00 ld [ %l4 ], %g1 return value - remainder + alignment; 200c808: b2 06 40 1a add %i1, %i2, %i1 200c80c: 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 = 200c810: 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; 200c814: 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 = 200c818: 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; 200c81c: 82 10 60 01 or %g1, 1, %g1 _Heap_Free_block( heap, new_first_block ); 200c820: 90 10 00 18 mov %i0, %o0 200c824: 7f ff ff 92 call 200c66c <_Heap_Free_block> 200c828: c2 22 60 04 st %g1, [ %o1 + 4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200c82c: 10 80 00 08 b 200c84c <_Heap_Extend+0x1b8> 200c830: 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 ) { 200c834: 80 a5 a0 00 cmp %l6, 0 200c838: 02 80 00 04 be 200c848 <_Heap_Extend+0x1b4> 200c83c: 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; 200c840: 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 = 200c844: ec 20 60 04 st %l6, [ %g1 + 4 ] link_below_block, extend_last_block ); } if ( merge_above_block != NULL ) { 200c848: 80 a7 20 00 cmp %i4, 0 200c84c: 02 80 00 15 be 200c8a0 <_Heap_Extend+0x20c> 200c850: 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); 200c854: 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( 200c858: ba 27 40 1c sub %i5, %i4, %i5 200c85c: 40 00 16 ed call 2012410 <.urem> 200c860: 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) 200c864: c4 07 20 04 ld [ %i4 + 4 ], %g2 200c868: 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 = 200c86c: 82 07 40 1c add %i5, %i4, %g1 (last_block->size_and_flag - last_block_new_size) 200c870: 84 20 80 1d sub %g2, %i5, %g2 | HEAP_PREV_BLOCK_USED; 200c874: 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 = 200c878: 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; 200c87c: 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 ); 200c880: 90 10 00 18 mov %i0, %o0 200c884: 82 08 60 01 and %g1, 1, %g1 200c888: 92 10 00 1c mov %i4, %o1 block->size_and_flag = size | flag; 200c88c: ba 17 40 01 or %i5, %g1, %i5 200c890: 7f ff ff 77 call 200c66c <_Heap_Free_block> 200c894: fa 27 20 04 st %i5, [ %i4 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200c898: 10 80 00 0f b 200c8d4 <_Heap_Extend+0x240> 200c89c: 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 ) { 200c8a0: 80 a5 60 00 cmp %l5, 0 200c8a4: 02 80 00 0b be 200c8d0 <_Heap_Extend+0x23c> 200c8a8: 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; 200c8ac: c6 05 60 04 ld [ %l5 + 4 ], %g3 _Heap_Link_above( 200c8b0: c2 07 bf fc ld [ %fp + -4 ], %g1 200c8b4: 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 ); 200c8b8: 84 20 80 15 sub %g2, %l5, %g2 block->size_and_flag = size | flag; 200c8bc: 84 10 c0 02 or %g3, %g2, %g2 200c8c0: c4 25 60 04 st %g2, [ %l5 + 4 ] last_block->size_and_flag |= HEAP_PREV_BLOCK_USED; 200c8c4: c4 00 60 04 ld [ %g1 + 4 ], %g2 200c8c8: 84 10 a0 01 or %g2, 1, %g2 200c8cc: c4 20 60 04 st %g2, [ %g1 + 4 ] extend_first_block, extend_last_block ); } if ( merge_below_block == NULL && merge_above_block == NULL ) { 200c8d0: 80 a7 20 00 cmp %i4, 0 200c8d4: 32 80 00 09 bne,a 200c8f8 <_Heap_Extend+0x264> 200c8d8: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200c8dc: 80 a5 20 00 cmp %l4, 0 200c8e0: 32 80 00 06 bne,a 200c8f8 <_Heap_Extend+0x264> 200c8e4: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 _Heap_Free_block( heap, extend_first_block ); 200c8e8: d2 07 bf f8 ld [ %fp + -8 ], %o1 200c8ec: 7f ff ff 60 call 200c66c <_Heap_Free_block> 200c8f0: 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 200c8f4: 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( 200c8f8: 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; 200c8fc: 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( 200c900: 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; 200c904: 86 08 e0 01 and %g3, 1, %g3 block->size_and_flag = size | flag; 200c908: 84 10 c0 02 or %g3, %g2, %g2 200c90c: c4 20 60 04 st %g2, [ %g1 + 4 ] } _Heap_Set_last_block_size( heap ); extended_size = stats->free_size - free_size; 200c910: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 stats->size += extended_size; if ( extended_size_ptr != NULL ) *extended_size_ptr = extended_size; return true; 200c914: 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; 200c918: a4 20 40 12 sub %g1, %l2, %l2 /* Statistics */ stats->size += extended_size; 200c91c: c2 06 20 2c ld [ %i0 + 0x2c ], %g1 if ( extended_size_ptr != NULL ) 200c920: 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; 200c924: 82 00 40 12 add %g1, %l2, %g1 if ( extended_size_ptr != NULL ) 200c928: 02 80 00 03 be 200c934 <_Heap_Extend+0x2a0> <== NEVER TAKEN 200c92c: c2 26 20 2c st %g1, [ %i0 + 0x2c ] 200c930: e4 26 c0 00 st %l2, [ %i3 ] *extended_size_ptr = extended_size; return true; } 200c934: b0 0f 20 01 and %i4, 1, %i0 200c938: 81 c7 e0 08 ret 200c93c: 81 e8 00 00 restore =============================================================================== 0200c88c <_Heap_Free>: return do_free; } #endif bool _Heap_Free( Heap_Control *heap, void *alloc_begin_ptr ) { 200c88c: 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; 200c890: 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 ) { 200c894: 80 a6 60 00 cmp %i1, 0 200c898: 02 80 00 77 be 200ca74 <_Heap_Free+0x1e8> 200c89c: 90 10 00 19 mov %i1, %o0 200c8a0: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 200c8a4: 40 00 2c 74 call 2017a74 <.urem> 200c8a8: 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 200c8ac: 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); 200c8b0: 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; 200c8b4: 80 a7 40 0d cmp %i5, %o5 200c8b8: 0a 80 00 05 bcs 200c8cc <_Heap_Free+0x40> 200c8bc: 82 10 20 00 clr %g1 200c8c0: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 200c8c4: 80 a0 40 1d cmp %g1, %i5 200c8c8: 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 ) ) { 200c8cc: 80 a0 60 00 cmp %g1, 0 200c8d0: 02 80 00 69 be 200ca74 <_Heap_Free+0x1e8> 200c8d4: 88 10 20 00 clr %g4 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200c8d8: 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; 200c8dc: 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); 200c8e0: 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; 200c8e4: 80 a0 40 0d cmp %g1, %o5 200c8e8: 0a 80 00 05 bcs 200c8fc <_Heap_Free+0x70> <== NEVER TAKEN 200c8ec: 86 10 20 00 clr %g3 200c8f0: c6 06 20 24 ld [ %i0 + 0x24 ], %g3 200c8f4: 80 a0 c0 01 cmp %g3, %g1 200c8f8: 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 ) ) { 200c8fc: 80 a0 e0 00 cmp %g3, 0 200c900: 02 80 00 5d be 200ca74 <_Heap_Free+0x1e8> <== NEVER TAKEN 200c904: 88 10 20 00 clr %g4 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200c908: de 00 60 04 ld [ %g1 + 4 ], %o7 return false; } _Heap_Protection_block_check( heap, next_block ); if ( !_Heap_Is_prev_used( next_block ) ) { 200c90c: 80 8b e0 01 btst 1, %o7 200c910: 02 80 00 59 be 200ca74 <_Heap_Free+0x1e8> <== NEVER TAKEN 200c914: 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 200c918: c8 06 20 24 ld [ %i0 + 0x24 ], %g4 && !_Heap_Is_prev_used( _Heap_Block_at( next_block, next_block_size )); 200c91c: 80 a0 40 04 cmp %g1, %g4 200c920: 02 80 00 07 be 200c93c <_Heap_Free+0xb0> 200c924: 98 10 20 00 clr %o4 --stats->used_blocks; ++stats->frees; stats->free_size += block_size; return( true ); } 200c928: 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; 200c92c: c6 00 e0 04 ld [ %g3 + 4 ], %g3 200c930: 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 )); 200c934: 80 a0 00 03 cmp %g0, %g3 200c938: 98 60 3f ff subx %g0, -1, %o4 if ( !_Heap_Is_prev_used( block ) ) { 200c93c: 80 8a e0 01 btst 1, %o3 200c940: 12 80 00 25 bne 200c9d4 <_Heap_Free+0x148> 200c944: 80 8b 20 ff btst 0xff, %o4 uintptr_t const prev_size = block->prev_size; 200c948: 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); 200c94c: 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; 200c950: 80 a0 c0 0d cmp %g3, %o5 200c954: 0a 80 00 04 bcs 200c964 <_Heap_Free+0xd8> <== NEVER TAKEN 200c958: 94 10 20 00 clr %o2 200c95c: 80 a1 00 03 cmp %g4, %g3 200c960: 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 ) ) { 200c964: 80 a2 a0 00 cmp %o2, 0 200c968: 02 80 00 43 be 200ca74 <_Heap_Free+0x1e8> <== NEVER TAKEN 200c96c: 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; 200c970: 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) ) { 200c974: 80 8b 60 01 btst 1, %o5 200c978: 02 80 00 3f be 200ca74 <_Heap_Free+0x1e8> <== NEVER TAKEN 200c97c: 80 8b 20 ff btst 0xff, %o4 _HAssert( false ); return( false ); } if ( next_is_free ) { /* coalesce both */ 200c980: 02 80 00 0e be 200c9b8 <_Heap_Free+0x12c> 200c984: 88 00 80 0b add %g2, %o3, %g4 uintptr_t const size = block_size + prev_size + next_block_size; 200c988: 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; 200c98c: c8 00 60 08 ld [ %g1 + 8 ], %g4 Heap_Block *prev = block->prev; 200c990: c2 00 60 0c ld [ %g1 + 0xc ], %g1 prev->next = next; 200c994: c8 20 60 08 st %g4, [ %g1 + 8 ] next->prev = prev; 200c998: c2 21 20 0c st %g1, [ %g4 + 0xc ] _Heap_Free_list_remove( next_block ); stats->free_blocks -= 1; 200c99c: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 200c9a0: 82 00 7f ff add %g1, -1, %g1 200c9a4: 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; 200c9a8: 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; 200c9ac: 82 13 e0 01 or %o7, 1, %g1 200c9b0: 10 80 00 27 b 200ca4c <_Heap_Free+0x1c0> 200c9b4: 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; 200c9b8: 9e 11 20 01 or %g4, 1, %o7 200c9bc: de 20 e0 04 st %o7, [ %g3 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200c9c0: c6 00 60 04 ld [ %g1 + 4 ], %g3 next_block->prev_size = size; 200c9c4: 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; 200c9c8: 86 08 ff fe and %g3, -2, %g3 200c9cc: 10 80 00 20 b 200ca4c <_Heap_Free+0x1c0> 200c9d0: c6 20 60 04 st %g3, [ %g1 + 4 ] next_block->prev_size = size; } } else if ( next_is_free ) { /* coalesce next */ 200c9d4: 22 80 00 0d be,a 200ca08 <_Heap_Free+0x17c> 200c9d8: 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; 200c9dc: c8 00 60 08 ld [ %g1 + 8 ], %g4 Heap_Block *prev = old_block->prev; 200c9e0: c2 00 60 0c ld [ %g1 + 0xc ], %g1 new_block->next = next; 200c9e4: c8 27 60 08 st %g4, [ %i5 + 8 ] new_block->prev = prev; 200c9e8: c2 27 60 0c st %g1, [ %i5 + 0xc ] uintptr_t const size = block_size + next_block_size; 200c9ec: 86 03 c0 02 add %o7, %g2, %g3 next->prev = new_block; prev->next = new_block; 200c9f0: 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; 200c9f4: fa 21 20 0c st %i5, [ %g4 + 0xc ] _Heap_Free_list_replace( next_block, block ); block->size_and_flag = size | HEAP_PREV_BLOCK_USED; 200c9f8: 82 10 e0 01 or %g3, 1, %g1 next_block = _Heap_Block_at( block, size ); next_block->prev_size = size; 200c9fc: 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; 200ca00: 10 80 00 13 b 200ca4c <_Heap_Free+0x1c0> 200ca04: c2 27 60 04 st %g1, [ %i5 + 4 ] ) { Heap_Block *next = block_before->next; new_block->next = next; new_block->prev = block_before; 200ca08: f0 27 60 0c st %i0, [ %i5 + 0xc ] Heap_Block *new_block ) { Heap_Block *next = block_before->next; new_block->next = next; 200ca0c: c6 27 60 08 st %g3, [ %i5 + 8 ] new_block->prev = block_before; block_before->next = new_block; next->prev = new_block; 200ca10: 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; 200ca14: 86 10 a0 01 or %g2, 1, %g3 200ca18: c6 27 60 04 st %g3, [ %i5 + 4 ] next_block->size_and_flag &= ~HEAP_PREV_BLOCK_USED; 200ca1c: c6 00 60 04 ld [ %g1 + 4 ], %g3 next_block->prev_size = block_size; 200ca20: 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; 200ca24: 86 08 ff fe and %g3, -2, %g3 200ca28: c6 20 60 04 st %g3, [ %g1 + 4 ] next_block->prev_size = block_size; /* Statistics */ ++stats->free_blocks; 200ca2c: c2 06 20 38 ld [ %i0 + 0x38 ], %g1 if ( stats->max_free_blocks < stats->free_blocks ) { 200ca30: 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; 200ca34: 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; 200ca38: fa 26 20 08 st %i5, [ %i0 + 8 ] if ( stats->max_free_blocks < stats->free_blocks ) { 200ca3c: 80 a0 c0 01 cmp %g3, %g1 200ca40: 1a 80 00 03 bcc 200ca4c <_Heap_Free+0x1c0> 200ca44: c2 26 20 38 st %g1, [ %i0 + 0x38 ] stats->max_free_blocks = stats->free_blocks; 200ca48: c2 26 20 3c st %g1, [ %i0 + 0x3c ] } } /* Statistics */ --stats->used_blocks; 200ca4c: c2 06 20 40 ld [ %i0 + 0x40 ], %g1 ++stats->frees; stats->free_size += block_size; return( true ); 200ca50: 88 10 20 01 mov 1, %g4 stats->max_free_blocks = stats->free_blocks; } } /* Statistics */ --stats->used_blocks; 200ca54: 82 00 7f ff add %g1, -1, %g1 200ca58: c2 26 20 40 st %g1, [ %i0 + 0x40 ] ++stats->frees; 200ca5c: c2 06 20 50 ld [ %i0 + 0x50 ], %g1 200ca60: 82 00 60 01 inc %g1 200ca64: c2 26 20 50 st %g1, [ %i0 + 0x50 ] stats->free_size += block_size; 200ca68: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 200ca6c: 84 00 40 02 add %g1, %g2, %g2 200ca70: c4 26 20 30 st %g2, [ %i0 + 0x30 ] return( true ); } 200ca74: b0 09 20 01 and %g4, 1, %i0 200ca78: 81 c7 e0 08 ret 200ca7c: 81 e8 00 00 restore =============================================================================== 02019a9c <_Heap_Size_of_alloc_area>: bool _Heap_Size_of_alloc_area( Heap_Control *heap, void *alloc_begin_ptr, uintptr_t *alloc_size ) { 2019a9c: 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); 2019aa0: d2 06 20 10 ld [ %i0 + 0x10 ], %o1 2019aa4: 7f ff f7 f4 call 2017a74 <.urem> 2019aa8: 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 2019aac: 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); 2019ab0: 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); 2019ab4: 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; 2019ab8: 80 a2 00 03 cmp %o0, %g3 2019abc: 0a 80 00 05 bcs 2019ad0 <_Heap_Size_of_alloc_area+0x34> 2019ac0: 84 10 20 00 clr %g2 2019ac4: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 2019ac8: 80 a0 40 08 cmp %g1, %o0 2019acc: 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 ) ) { 2019ad0: 80 a0 a0 00 cmp %g2, 0 2019ad4: 02 80 00 15 be 2019b28 <_Heap_Size_of_alloc_area+0x8c> 2019ad8: 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; 2019adc: fa 02 20 04 ld [ %o0 + 4 ], %i5 2019ae0: 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); 2019ae4: 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; 2019ae8: 80 a7 40 03 cmp %i5, %g3 2019aec: 0a 80 00 05 bcs 2019b00 <_Heap_Size_of_alloc_area+0x64> <== NEVER TAKEN 2019af0: 84 10 20 00 clr %g2 2019af4: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 2019af8: 80 a0 40 1d cmp %g1, %i5 2019afc: 84 60 3f ff subx %g0, -1, %g2 } block_size = _Heap_Block_size( block ); next_block = _Heap_Block_at( block, block_size ); if ( 2019b00: 80 a0 a0 00 cmp %g2, 0 2019b04: 02 80 00 09 be 2019b28 <_Heap_Size_of_alloc_area+0x8c> <== NEVER TAKEN 2019b08: 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; 2019b0c: c4 07 60 04 ld [ %i5 + 4 ], %g2 !_Heap_Is_block_in_heap( heap, next_block ) || !_Heap_Is_prev_used( next_block ) 2019b10: 80 88 a0 01 btst 1, %g2 2019b14: 02 80 00 05 be 2019b28 <_Heap_Size_of_alloc_area+0x8c> <== NEVER TAKEN 2019b18: ba 27 40 19 sub %i5, %i1, %i5 return false; } *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin; return true; 2019b1c: 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; 2019b20: ba 07 60 04 add %i5, 4, %i5 2019b24: fa 26 80 00 st %i5, [ %i2 ] return true; } 2019b28: b0 08 60 01 and %g1, 1, %i0 2019b2c: 81 c7 e0 08 ret 2019b30: 81 e8 00 00 restore =============================================================================== 020080cc <_Heap_Walk>: bool _Heap_Walk( Heap_Control *heap, int source, bool dump ) { 20080cc: 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; 20080d0: 3b 00 80 20 sethi %hi(0x2008000), %i5 Heap_Control *heap, int source, bool dump ) { uintptr_t const page_size = heap->page_size; 20080d4: f8 06 20 10 ld [ %i0 + 0x10 ], %i4 uintptr_t const min_block_size = heap->min_block_size; 20080d8: e0 06 20 14 ld [ %i0 + 0x14 ], %l0 Heap_Block *const first_block = heap->first_block; 20080dc: f6 06 20 20 ld [ %i0 + 0x20 ], %i3 Heap_Block *const last_block = heap->last_block; 20080e0: 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; 20080e4: 80 a6 a0 00 cmp %i2, 0 20080e8: 02 80 00 04 be 20080f8 <_Heap_Walk+0x2c> 20080ec: ba 17 60 78 or %i5, 0x78, %i5 20080f0: 3b 00 80 20 sethi %hi(0x2008000), %i5 20080f4: ba 17 60 80 or %i5, 0x80, %i5 ! 2008080 <_Heap_Walk_print> if ( !_System_state_Is_up( _System_state_Get() ) ) { 20080f8: 03 00 80 60 sethi %hi(0x2018000), %g1 20080fc: c4 00 62 ec ld [ %g1 + 0x2ec ], %g2 ! 20182ec <_System_state_Current> 2008100: 80 a0 a0 03 cmp %g2, 3 2008104: 12 80 01 24 bne 2008594 <_Heap_Walk+0x4c8> 2008108: 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)( 200810c: c2 06 20 1c ld [ %i0 + 0x1c ], %g1 2008110: da 06 20 18 ld [ %i0 + 0x18 ], %o5 2008114: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2008118: f6 23 a0 60 st %i3, [ %sp + 0x60 ] 200811c: e2 23 a0 64 st %l1, [ %sp + 0x64 ] 2008120: c2 06 20 08 ld [ %i0 + 8 ], %g1 2008124: 90 10 00 19 mov %i1, %o0 2008128: c2 23 a0 68 st %g1, [ %sp + 0x68 ] 200812c: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2008130: 92 10 20 00 clr %o1 2008134: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 2008138: 15 00 80 55 sethi %hi(0x2015400), %o2 200813c: 96 10 00 1c mov %i4, %o3 2008140: 94 12 a2 58 or %o2, 0x258, %o2 2008144: 9f c7 40 00 call %i5 2008148: 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 ) { 200814c: 80 a7 20 00 cmp %i4, 0 2008150: 12 80 00 07 bne 200816c <_Heap_Walk+0xa0> 2008154: 80 8f 20 07 btst 7, %i4 (*printer)( source, true, "page size is zero\n" ); 2008158: 15 00 80 55 sethi %hi(0x2015400), %o2 200815c: 90 10 00 19 mov %i1, %o0 2008160: 92 10 20 01 mov 1, %o1 2008164: 10 80 00 32 b 200822c <_Heap_Walk+0x160> 2008168: 94 12 a2 f0 or %o2, 0x2f0, %o2 return false; } if ( !_Addresses_Is_aligned( (void *) page_size ) ) { 200816c: 22 80 00 08 be,a 200818c <_Heap_Walk+0xc0> 2008170: 90 10 00 10 mov %l0, %o0 (*printer)( 2008174: 15 00 80 55 sethi %hi(0x2015400), %o2 2008178: 90 10 00 19 mov %i1, %o0 200817c: 92 10 20 01 mov 1, %o1 2008180: 94 12 a3 08 or %o2, 0x308, %o2 2008184: 10 80 01 0b b 20085b0 <_Heap_Walk+0x4e4> 2008188: 96 10 00 1c mov %i4, %o3 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200818c: 7f ff e6 55 call 2001ae0 <.urem> 2008190: 92 10 00 1c mov %i4, %o1 ); return false; } if ( !_Heap_Is_aligned( min_block_size, page_size ) ) { 2008194: 80 a2 20 00 cmp %o0, 0 2008198: 22 80 00 08 be,a 20081b8 <_Heap_Walk+0xec> 200819c: 90 06 e0 08 add %i3, 8, %o0 (*printer)( 20081a0: 15 00 80 55 sethi %hi(0x2015400), %o2 20081a4: 90 10 00 19 mov %i1, %o0 20081a8: 92 10 20 01 mov 1, %o1 20081ac: 94 12 a3 28 or %o2, 0x328, %o2 20081b0: 10 80 01 00 b 20085b0 <_Heap_Walk+0x4e4> 20081b4: 96 10 00 10 mov %l0, %o3 20081b8: 7f ff e6 4a call 2001ae0 <.urem> 20081bc: 92 10 00 1c mov %i4, %o1 ); return false; } if ( 20081c0: 80 a2 20 00 cmp %o0, 0 20081c4: 22 80 00 08 be,a 20081e4 <_Heap_Walk+0x118> 20081c8: c2 06 e0 04 ld [ %i3 + 4 ], %g1 !_Heap_Is_aligned( _Heap_Alloc_area_of_block( first_block ), page_size ) ) { (*printer)( 20081cc: 15 00 80 55 sethi %hi(0x2015400), %o2 20081d0: 90 10 00 19 mov %i1, %o0 20081d4: 92 10 20 01 mov 1, %o1 20081d8: 94 12 a3 50 or %o2, 0x350, %o2 20081dc: 10 80 00 f5 b 20085b0 <_Heap_Walk+0x4e4> 20081e0: 96 10 00 1b mov %i3, %o3 ); return false; } if ( !_Heap_Is_prev_used( first_block ) ) { 20081e4: 80 88 60 01 btst 1, %g1 20081e8: 32 80 00 07 bne,a 2008204 <_Heap_Walk+0x138> 20081ec: f4 04 60 04 ld [ %l1 + 4 ], %i2 (*printer)( 20081f0: 15 00 80 55 sethi %hi(0x2015400), %o2 20081f4: 90 10 00 19 mov %i1, %o0 20081f8: 92 10 20 01 mov 1, %o1 20081fc: 10 80 00 0c b 200822c <_Heap_Walk+0x160> 2008200: 94 12 a3 88 or %o2, 0x388, %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; 2008204: 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); 2008208: 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; 200820c: c2 06 a0 04 ld [ %i2 + 4 ], %g1 ); return false; } if ( _Heap_Is_free( last_block ) ) { 2008210: 80 88 60 01 btst 1, %g1 2008214: 12 80 00 0a bne 200823c <_Heap_Walk+0x170> 2008218: 80 a6 80 1b cmp %i2, %i3 (*printer)( 200821c: 15 00 80 55 sethi %hi(0x2015400), %o2 2008220: 90 10 00 19 mov %i1, %o0 2008224: 92 10 20 01 mov 1, %o1 2008228: 94 12 a3 b8 or %o2, 0x3b8, %o2 200822c: 9f c7 40 00 call %i5 2008230: 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; 2008234: 10 80 00 d8 b 2008594 <_Heap_Walk+0x4c8> 2008238: 82 10 20 00 clr %g1 ! 0 ); return false; } if ( 200823c: 02 80 00 06 be 2008254 <_Heap_Walk+0x188> 2008240: 15 00 80 55 sethi %hi(0x2015400), %o2 _Heap_Block_at( last_block, _Heap_Block_size( last_block ) ) != first_block ) { (*printer)( 2008244: 90 10 00 19 mov %i1, %o0 2008248: 92 10 20 01 mov 1, %o1 200824c: 10 bf ff f8 b 200822c <_Heap_Walk+0x160> 2008250: 94 12 a3 d0 or %o2, 0x3d0, %o2 int source, Heap_Walk_printer printer, Heap_Control *heap ) { uintptr_t const page_size = heap->page_size; 2008254: 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; 2008258: d6 06 20 08 ld [ %i0 + 8 ], %o3 const Heap_Block *const free_list_tail = _Heap_Free_list_tail( heap ); 200825c: 10 80 00 33 b 2008328 <_Heap_Walk+0x25c> 2008260: 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; 2008264: 80 a0 80 0b cmp %g2, %o3 2008268: 18 80 00 05 bgu 200827c <_Heap_Walk+0x1b0> 200826c: 82 10 20 00 clr %g1 2008270: c2 06 20 24 ld [ %i0 + 0x24 ], %g1 2008274: 80 a0 40 0b cmp %g1, %o3 2008278: 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 ) ) { 200827c: 80 a0 60 00 cmp %g1, 0 2008280: 32 80 00 07 bne,a 200829c <_Heap_Walk+0x1d0> 2008284: 90 02 e0 08 add %o3, 8, %o0 (*printer)( 2008288: 15 00 80 56 sethi %hi(0x2015800), %o2 200828c: 90 10 00 19 mov %i1, %o0 2008290: 92 10 20 01 mov 1, %o1 2008294: 10 80 00 c7 b 20085b0 <_Heap_Walk+0x4e4> 2008298: 94 12 a0 00 mov %o2, %o2 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 200829c: d6 27 bf fc st %o3, [ %fp + -4 ] 20082a0: 7f ff e6 10 call 2001ae0 <.urem> 20082a4: 92 10 00 13 mov %l3, %o1 ); return false; } if ( 20082a8: 80 a2 20 00 cmp %o0, 0 20082ac: 02 80 00 07 be 20082c8 <_Heap_Walk+0x1fc> 20082b0: d6 07 bf fc ld [ %fp + -4 ], %o3 !_Heap_Is_aligned( _Heap_Alloc_area_of_block( free_block ), page_size ) ) { (*printer)( 20082b4: 15 00 80 56 sethi %hi(0x2015800), %o2 20082b8: 90 10 00 19 mov %i1, %o0 20082bc: 92 10 20 01 mov 1, %o1 20082c0: 10 80 00 bc b 20085b0 <_Heap_Walk+0x4e4> 20082c4: 94 12 a0 20 or %o2, 0x20, %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; 20082c8: c2 02 e0 04 ld [ %o3 + 4 ], %g1 20082cc: 82 08 7f fe and %g1, -2, %g1 block = next_block; } while ( block != first_block ); return true; } 20082d0: 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; 20082d4: c2 00 60 04 ld [ %g1 + 4 ], %g1 ); return false; } if ( _Heap_Is_used( free_block ) ) { 20082d8: 80 88 60 01 btst 1, %g1 20082dc: 22 80 00 07 be,a 20082f8 <_Heap_Walk+0x22c> 20082e0: d8 02 e0 0c ld [ %o3 + 0xc ], %o4 (*printer)( 20082e4: 15 00 80 56 sethi %hi(0x2015800), %o2 20082e8: 90 10 00 19 mov %i1, %o0 20082ec: 92 10 20 01 mov 1, %o1 20082f0: 10 80 00 b0 b 20085b0 <_Heap_Walk+0x4e4> 20082f4: 94 12 a0 50 or %o2, 0x50, %o2 ); return false; } if ( free_block->prev != prev_block ) { 20082f8: 80 a3 00 12 cmp %o4, %l2 20082fc: 22 80 00 0a be,a 2008324 <_Heap_Walk+0x258> 2008300: a4 10 00 0b mov %o3, %l2 (*printer)( 2008304: 15 00 80 56 sethi %hi(0x2015800), %o2 2008308: 90 10 00 19 mov %i1, %o0 200830c: 92 10 20 01 mov 1, %o1 2008310: 94 12 a0 70 or %o2, 0x70, %o2 2008314: 9f c7 40 00 call %i5 2008318: 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; 200831c: 10 80 00 9e b 2008594 <_Heap_Walk+0x4c8> 2008320: 82 10 20 00 clr %g1 ! 0 return false; } prev_block = free_block; free_block = free_block->next; 2008324: 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 ) { 2008328: 80 a2 c0 18 cmp %o3, %i0 200832c: 32 bf ff ce bne,a 2008264 <_Heap_Walk+0x198> 2008330: c4 06 20 20 ld [ %i0 + 0x20 ], %g2 2008334: 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)( 2008338: 2f 00 80 56 sethi %hi(0x2015800), %l7 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 200833c: ac 15 a2 30 or %l6, 0x230, %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)( 2008340: ae 15 e2 18 or %l7, 0x218, %l7 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008344: 2b 00 80 56 sethi %hi(0x2015800), %l5 block = next_block; } while ( block != first_block ); return true; } 2008348: 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; 200834c: 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; 2008350: 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); 2008354: 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; 2008358: 80 a0 c0 13 cmp %g3, %l3 200835c: 18 80 00 05 bgu 2008370 <_Heap_Walk+0x2a4> <== NEVER TAKEN 2008360: 84 10 20 00 clr %g2 2008364: c4 06 20 24 ld [ %i0 + 0x24 ], %g2 2008368: 80 a0 80 13 cmp %g2, %l3 200836c: 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 ) ) { 2008370: 80 a0 a0 00 cmp %g2, 0 2008374: 12 80 00 07 bne 2008390 <_Heap_Walk+0x2c4> 2008378: 84 1e 80 11 xor %i2, %l1, %g2 (*printer)( 200837c: 15 00 80 56 sethi %hi(0x2015800), %o2 2008380: 90 10 00 19 mov %i1, %o0 2008384: 92 10 20 01 mov 1, %o1 2008388: 10 80 00 2c b 2008438 <_Heap_Walk+0x36c> 200838c: 94 12 a0 a8 or %o2, 0xa8, %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; 2008390: 80 a0 00 02 cmp %g0, %g2 RTEMS_INLINE_ROUTINE bool _Heap_Is_aligned( uintptr_t value, uintptr_t alignment ) { return (value % alignment) == 0; 2008394: c2 27 bf fc st %g1, [ %fp + -4 ] 2008398: a8 40 20 00 addx %g0, 0, %l4 200839c: 90 10 00 12 mov %l2, %o0 20083a0: 7f ff e5 d0 call 2001ae0 <.urem> 20083a4: 92 10 00 1c mov %i4, %o1 ); return false; } if ( !_Heap_Is_aligned( block_size, page_size ) && is_not_last_block ) { 20083a8: 80 a2 20 00 cmp %o0, 0 20083ac: 02 80 00 0c be 20083dc <_Heap_Walk+0x310> 20083b0: c2 07 bf fc ld [ %fp + -4 ], %g1 20083b4: 80 8d 20 ff btst 0xff, %l4 20083b8: 02 80 00 0a be 20083e0 <_Heap_Walk+0x314> 20083bc: 80 a4 80 10 cmp %l2, %l0 (*printer)( 20083c0: 15 00 80 56 sethi %hi(0x2015800), %o2 20083c4: 90 10 00 19 mov %i1, %o0 20083c8: 92 10 20 01 mov 1, %o1 20083cc: 94 12 a0 d8 or %o2, 0xd8, %o2 20083d0: 96 10 00 1a mov %i2, %o3 20083d4: 10 bf ff d0 b 2008314 <_Heap_Walk+0x248> 20083d8: 98 10 00 12 mov %l2, %o4 ); return false; } if ( block_size < min_block_size && is_not_last_block ) { 20083dc: 80 a4 80 10 cmp %l2, %l0 20083e0: 1a 80 00 0d bcc 2008414 <_Heap_Walk+0x348> 20083e4: 80 a4 c0 1a cmp %l3, %i2 20083e8: 80 8d 20 ff btst 0xff, %l4 20083ec: 02 80 00 0a be 2008414 <_Heap_Walk+0x348> <== NEVER TAKEN 20083f0: 80 a4 c0 1a cmp %l3, %i2 (*printer)( 20083f4: 15 00 80 56 sethi %hi(0x2015800), %o2 20083f8: 90 10 00 19 mov %i1, %o0 20083fc: 92 10 20 01 mov 1, %o1 2008400: 94 12 a1 08 or %o2, 0x108, %o2 2008404: 96 10 00 1a mov %i2, %o3 2008408: 98 10 00 12 mov %l2, %o4 200840c: 10 80 00 3d b 2008500 <_Heap_Walk+0x434> 2008410: 9a 10 00 10 mov %l0, %o5 ); return false; } if ( next_block_begin <= block_begin && is_not_last_block ) { 2008414: 38 80 00 0c bgu,a 2008444 <_Heap_Walk+0x378> 2008418: a8 08 60 01 and %g1, 1, %l4 200841c: 80 8d 20 ff btst 0xff, %l4 2008420: 02 80 00 09 be 2008444 <_Heap_Walk+0x378> 2008424: a8 08 60 01 and %g1, 1, %l4 (*printer)( 2008428: 15 00 80 56 sethi %hi(0x2015800), %o2 200842c: 90 10 00 19 mov %i1, %o0 2008430: 92 10 20 01 mov 1, %o1 2008434: 94 12 a1 38 or %o2, 0x138, %o2 2008438: 96 10 00 1a mov %i2, %o3 200843c: 10 bf ff b6 b 2008314 <_Heap_Walk+0x248> 2008440: 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; 2008444: c2 04 e0 04 ld [ %l3 + 4 ], %g1 ); return false; } if ( !_Heap_Is_prev_used( next_block ) ) { 2008448: 80 88 60 01 btst 1, %g1 200844c: 12 80 00 40 bne 200854c <_Heap_Walk+0x480> 2008450: 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 ? 2008454: 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)( 2008458: c2 06 20 08 ld [ %i0 + 8 ], %g1 200845c: 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; 2008460: c8 06 20 0c ld [ %i0 + 0xc ], %g4 2008464: 80 a3 40 01 cmp %o5, %g1 2008468: 02 80 00 07 be 2008484 <_Heap_Walk+0x3b8> 200846c: 86 10 a2 18 or %g2, 0x218, %g3 block, block_size, block->prev, block->prev == first_free_block ? " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), 2008470: 80 a3 40 18 cmp %o5, %i0 2008474: 12 80 00 04 bne 2008484 <_Heap_Walk+0x3b8> 2008478: 86 15 61 e0 or %l5, 0x1e0, %g3 200847c: 07 00 80 55 sethi %hi(0x2015400), %g3 2008480: 86 10 e2 28 or %g3, 0x228, %g3 ! 2015628 <_Status_Object_name_errors_to_status+0x48> block->next, block->next == last_free_block ? 2008484: 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)( 2008488: 1f 00 80 55 sethi %hi(0x2015400), %o7 200848c: 80 a0 80 04 cmp %g2, %g4 2008490: 02 80 00 07 be 20084ac <_Heap_Walk+0x3e0> 2008494: 82 13 e2 38 or %o7, 0x238, %g1 " (= first free)" : (block->prev == free_list_head ? " (= head)" : ""), block->next, block->next == last_free_block ? " (= last free)" : (block->next == free_list_tail ? " (= tail)" : "") 2008498: 80 a0 80 18 cmp %g2, %i0 200849c: 12 80 00 04 bne 20084ac <_Heap_Walk+0x3e0> 20084a0: 82 15 61 e0 or %l5, 0x1e0, %g1 20084a4: 03 00 80 55 sethi %hi(0x2015400), %g1 20084a8: 82 10 62 48 or %g1, 0x248, %g1 ! 2015648 <_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)( 20084ac: c6 23 a0 5c st %g3, [ %sp + 0x5c ] 20084b0: c4 23 a0 60 st %g2, [ %sp + 0x60 ] 20084b4: c2 23 a0 64 st %g1, [ %sp + 0x64 ] 20084b8: 90 10 00 19 mov %i1, %o0 20084bc: 92 10 20 00 clr %o1 20084c0: 15 00 80 56 sethi %hi(0x2015800), %o2 20084c4: 96 10 00 1a mov %i2, %o3 20084c8: 94 12 a1 70 or %o2, 0x170, %o2 20084cc: 9f c7 40 00 call %i5 20084d0: 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 ) { 20084d4: da 04 c0 00 ld [ %l3 ], %o5 20084d8: 80 a4 80 0d cmp %l2, %o5 20084dc: 02 80 00 0d be 2008510 <_Heap_Walk+0x444> 20084e0: 80 a5 20 00 cmp %l4, 0 (*printer)( 20084e4: 15 00 80 56 sethi %hi(0x2015800), %o2 20084e8: e6 23 a0 5c st %l3, [ %sp + 0x5c ] 20084ec: 90 10 00 19 mov %i1, %o0 20084f0: 92 10 20 01 mov 1, %o1 20084f4: 94 12 a1 a8 or %o2, 0x1a8, %o2 20084f8: 96 10 00 1a mov %i2, %o3 20084fc: 98 10 00 12 mov %l2, %o4 2008500: 9f c7 40 00 call %i5 2008504: 01 00 00 00 nop 2008508: 10 80 00 23 b 2008594 <_Heap_Walk+0x4c8> 200850c: 82 10 20 00 clr %g1 ! 0 ); return false; } if ( !prev_used ) { 2008510: 32 80 00 0a bne,a 2008538 <_Heap_Walk+0x46c> 2008514: c2 06 20 08 ld [ %i0 + 8 ], %g1 (*printer)( 2008518: 15 00 80 56 sethi %hi(0x2015800), %o2 200851c: 90 10 00 19 mov %i1, %o0 2008520: 92 10 20 01 mov 1, %o1 2008524: 10 80 00 22 b 20085ac <_Heap_Walk+0x4e0> 2008528: 94 12 a1 e8 or %o2, 0x1e8, %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 ) { 200852c: 02 80 00 17 be 2008588 <_Heap_Walk+0x4bc> 2008530: 80 a4 c0 1b cmp %l3, %i3 return true; } free_block = free_block->next; 2008534: 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 ) { 2008538: 80 a0 40 18 cmp %g1, %i0 200853c: 12 bf ff fc bne 200852c <_Heap_Walk+0x460> 2008540: 80 a0 40 1a cmp %g1, %i2 return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 2008544: 10 80 00 17 b 20085a0 <_Heap_Walk+0x4d4> 2008548: 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) { 200854c: 80 a5 20 00 cmp %l4, 0 2008550: 02 80 00 08 be 2008570 <_Heap_Walk+0x4a4> 2008554: 92 10 20 00 clr %o1 (*printer)( 2008558: 94 10 00 17 mov %l7, %o2 200855c: 96 10 00 1a mov %i2, %o3 2008560: 9f c7 40 00 call %i5 2008564: 98 10 00 12 mov %l2, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 2008568: 10 80 00 08 b 2008588 <_Heap_Walk+0x4bc> 200856c: 80 a4 c0 1b cmp %l3, %i3 "block 0x%08x: size %u\n", block, block_size ); } else { (*printer)( 2008570: da 06 80 00 ld [ %i2 ], %o5 2008574: 94 10 00 16 mov %l6, %o2 2008578: 96 10 00 1a mov %i2, %o3 200857c: 9f c7 40 00 call %i5 2008580: 98 10 00 12 mov %l2, %o4 block->prev_size ); } block = next_block; } while ( block != first_block ); 2008584: 80 a4 c0 1b cmp %l3, %i3 2008588: 12 bf ff 70 bne 2008348 <_Heap_Walk+0x27c> 200858c: b4 10 00 13 mov %l3, %i2 return true; 2008590: 82 10 20 01 mov 1, %g1 } 2008594: b0 08 60 01 and %g1, 1, %i0 2008598: 81 c7 e0 08 ret 200859c: 81 e8 00 00 restore return false; } if ( !_Heap_Walk_is_in_free_list( heap, block ) ) { (*printer)( 20085a0: 90 10 00 19 mov %i1, %o0 20085a4: 92 10 20 01 mov 1, %o1 20085a8: 94 12 a2 58 or %o2, 0x258, %o2 20085ac: 96 10 00 1a mov %i2, %o3 20085b0: 9f c7 40 00 call %i5 20085b4: 01 00 00 00 nop 20085b8: 10 bf ff f7 b 2008594 <_Heap_Walk+0x4c8> 20085bc: 82 10 20 00 clr %g1 ! 0 =============================================================================== 02007860 <_Objects_Allocate>: */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 2007860: 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 ) 2007864: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 */ Objects_Control *_Objects_Allocate( Objects_Information *information ) { 2007868: 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 ) 200786c: 80 a0 60 00 cmp %g1, 0 2007870: 02 80 00 20 be 20078f0 <_Objects_Allocate+0x90> <== NEVER TAKEN 2007874: 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 ); 2007878: b8 07 60 20 add %i5, 0x20, %i4 200787c: 7f ff fd 87 call 2006e98 <_Chain_Get> 2007880: 90 10 00 1c mov %i4, %o0 if ( information->auto_extend ) { 2007884: c2 0f 60 12 ldub [ %i5 + 0x12 ], %g1 2007888: 80 a0 60 00 cmp %g1, 0 200788c: 02 80 00 19 be 20078f0 <_Objects_Allocate+0x90> 2007890: 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 ) { 2007894: 80 a2 20 00 cmp %o0, 0 2007898: 32 80 00 0a bne,a 20078c0 <_Objects_Allocate+0x60> 200789c: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 _Objects_Extend_information( information ); 20078a0: 40 00 00 1d call 2007914 <_Objects_Extend_information> 20078a4: 90 10 00 1d mov %i5, %o0 the_object = (Objects_Control *) _Chain_Get( &information->Inactive ); 20078a8: 7f ff fd 7c call 2006e98 <_Chain_Get> 20078ac: 90 10 00 1c mov %i4, %o0 } if ( the_object ) { 20078b0: b0 92 20 00 orcc %o0, 0, %i0 20078b4: 02 80 00 0f be 20078f0 <_Objects_Allocate+0x90> 20078b8: 01 00 00 00 nop uint32_t block; block = (uint32_t) _Objects_Get_index( the_object->id ) - 20078bc: c2 17 60 0a lduh [ %i5 + 0xa ], %g1 20078c0: d0 16 20 0a lduh [ %i0 + 0xa ], %o0 _Objects_Get_index( information->minimum_id ); block /= information->allocation_size; 20078c4: d2 17 60 14 lduh [ %i5 + 0x14 ], %o1 20078c8: 40 00 3f bf call 20177c4 <.udiv> 20078cc: 90 22 00 01 sub %o0, %g1, %o0 information->inactive_per_block[ block ]--; 20078d0: c2 07 60 30 ld [ %i5 + 0x30 ], %g1 20078d4: 91 2a 20 02 sll %o0, 2, %o0 20078d8: c4 00 40 08 ld [ %g1 + %o0 ], %g2 20078dc: 84 00 bf ff add %g2, -1, %g2 20078e0: c4 20 40 08 st %g2, [ %g1 + %o0 ] information->inactive--; 20078e4: c2 17 60 2c lduh [ %i5 + 0x2c ], %g1 20078e8: 82 00 7f ff add %g1, -1, %g1 20078ec: c2 37 60 2c sth %g1, [ %i5 + 0x2c ] ); } #endif return the_object; } 20078f0: 81 c7 e0 08 ret 20078f4: 81 e8 00 00 restore =============================================================================== 02007c6c <_Objects_Get_information>: Objects_Information *_Objects_Get_information( Objects_APIs the_api, uint16_t the_class ) { 2007c6c: 9d e3 bf a0 save %sp, -96, %sp Objects_Information *info; int the_class_api_maximum; if ( !the_class ) 2007c70: 80 a6 60 00 cmp %i1, 0 2007c74: 02 80 00 17 be 2007cd0 <_Objects_Get_information+0x64> 2007c78: 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 ); 2007c7c: 40 00 13 81 call 200ca80 <_Objects_API_maximum_class> 2007c80: 90 10 00 18 mov %i0, %o0 if ( the_class_api_maximum == 0 ) 2007c84: 80 a2 20 00 cmp %o0, 0 2007c88: 02 80 00 12 be 2007cd0 <_Objects_Get_information+0x64> 2007c8c: 80 a6 40 08 cmp %i1, %o0 return NULL; if ( the_class > (uint32_t) the_class_api_maximum ) 2007c90: 18 80 00 10 bgu 2007cd0 <_Objects_Get_information+0x64> 2007c94: 03 00 80 72 sethi %hi(0x201c800), %g1 return NULL; if ( !_Objects_Information_table[ the_api ] ) 2007c98: b1 2e 20 02 sll %i0, 2, %i0 2007c9c: 82 10 60 68 or %g1, 0x68, %g1 2007ca0: c2 00 40 18 ld [ %g1 + %i0 ], %g1 2007ca4: 80 a0 60 00 cmp %g1, 0 2007ca8: 02 80 00 0a be 2007cd0 <_Objects_Get_information+0x64> <== NEVER TAKEN 2007cac: b3 2e 60 02 sll %i1, 2, %i1 return NULL; info = _Objects_Information_table[ the_api ][ the_class ]; 2007cb0: fa 00 40 19 ld [ %g1 + %i1 ], %i5 if ( !info ) 2007cb4: 80 a7 60 00 cmp %i5, 0 2007cb8: 02 80 00 06 be 2007cd0 <_Objects_Get_information+0x64> <== NEVER TAKEN 2007cbc: 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 ) 2007cc0: c2 17 60 10 lduh [ %i5 + 0x10 ], %g1 return NULL; 2007cc4: 80 a0 00 01 cmp %g0, %g1 2007cc8: 82 60 20 00 subx %g0, 0, %g1 2007ccc: ba 0f 40 01 and %i5, %g1, %i5 #endif return info; } 2007cd0: 81 c7 e0 08 ret 2007cd4: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 0200909c <_Objects_Id_to_name>: */ Objects_Name_or_id_lookup_errors _Objects_Id_to_name ( Objects_Id id, Objects_Name *name ) { 200909c: 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; 20090a0: 92 96 20 00 orcc %i0, 0, %o1 20090a4: 12 80 00 06 bne 20090bc <_Objects_Id_to_name+0x20> 20090a8: 83 32 60 18 srl %o1, 0x18, %g1 20090ac: 03 00 80 79 sethi %hi(0x201e400), %g1 20090b0: c2 00 63 34 ld [ %g1 + 0x334 ], %g1 ! 201e734 <_Per_CPU_Information+0xc> 20090b4: d2 00 60 08 ld [ %g1 + 8 ], %o1 20090b8: 83 32 60 18 srl %o1, 0x18, %g1 20090bc: 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 ) 20090c0: 84 00 7f ff add %g1, -1, %g2 20090c4: 80 a0 a0 02 cmp %g2, 2 20090c8: 18 80 00 16 bgu 2009120 <_Objects_Id_to_name+0x84> 20090cc: 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 ] ) 20090d0: 10 80 00 16 b 2009128 <_Objects_Id_to_name+0x8c> 20090d4: 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 ]; 20090d8: 85 28 a0 02 sll %g2, 2, %g2 20090dc: d0 00 40 02 ld [ %g1 + %g2 ], %o0 if ( !information ) 20090e0: 80 a2 20 00 cmp %o0, 0 20090e4: 02 80 00 0f be 2009120 <_Objects_Id_to_name+0x84> <== NEVER TAKEN 20090e8: 01 00 00 00 nop return OBJECTS_INVALID_ID; #if defined(RTEMS_SCORE_OBJECT_ENABLE_STRING_NAMES) if ( information->is_string ) 20090ec: c2 0a 20 38 ldub [ %o0 + 0x38 ], %g1 20090f0: 80 a0 60 00 cmp %g1, 0 20090f4: 12 80 00 0b bne 2009120 <_Objects_Id_to_name+0x84> <== NEVER TAKEN 20090f8: 01 00 00 00 nop return OBJECTS_INVALID_ID; #endif the_object = _Objects_Get( information, tmpId, &ignored_location ); 20090fc: 7f ff ff ca call 2009024 <_Objects_Get> 2009100: 94 07 bf fc add %fp, -4, %o2 if ( !the_object ) 2009104: 80 a2 20 00 cmp %o0, 0 2009108: 02 80 00 06 be 2009120 <_Objects_Id_to_name+0x84> 200910c: 01 00 00 00 nop return OBJECTS_INVALID_ID; *name = the_object->name; 2009110: c2 02 20 0c ld [ %o0 + 0xc ], %g1 _Thread_Enable_dispatch(); return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; 2009114: 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(); 2009118: 40 00 03 78 call 2009ef8 <_Thread_Enable_dispatch> 200911c: c2 26 40 00 st %g1, [ %i1 ] return OBJECTS_NAME_OR_ID_LOOKUP_SUCCESSFUL; } 2009120: 81 c7 e0 08 ret 2009124: 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 ] ) 2009128: 05 00 80 78 sethi %hi(0x201e000), %g2 200912c: 84 10 a1 58 or %g2, 0x158, %g2 ! 201e158 <_Objects_Information_table> 2009130: c2 00 80 01 ld [ %g2 + %g1 ], %g1 2009134: 80 a0 60 00 cmp %g1, 0 2009138: 12 bf ff e8 bne 20090d8 <_Objects_Id_to_name+0x3c> 200913c: 85 32 60 1b srl %o1, 0x1b, %g2 2009140: 30 bf ff f8 b,a 2009120 <_Objects_Id_to_name+0x84> =============================================================================== 0200b218 <_POSIX_Message_queue_Receive_support>: size_t msg_len, unsigned int *msg_prio, bool wait, Watchdog_Interval timeout ) { 200b218: 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( 200b21c: 11 00 80 9a sethi %hi(0x2026800), %o0 200b220: 92 10 00 18 mov %i0, %o1 200b224: 90 12 23 cc or %o0, 0x3cc, %o0 200b228: 40 00 0c 81 call 200e42c <_Objects_Get> 200b22c: 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 ) { 200b230: c2 07 bf f8 ld [ %fp + -8 ], %g1 200b234: 80 a0 60 00 cmp %g1, 0 200b238: 12 80 00 3f bne 200b334 <_POSIX_Message_queue_Receive_support+0x11c> 200b23c: 01 00 00 00 nop case OBJECTS_LOCAL: if ( (the_mq_fd->oflag & O_ACCMODE) == O_WRONLY ) { 200b240: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200b244: 84 08 60 03 and %g1, 3, %g2 200b248: 80 a0 a0 01 cmp %g2, 1 200b24c: 32 80 00 08 bne,a 200b26c <_POSIX_Message_queue_Receive_support+0x54> 200b250: d0 02 20 10 ld [ %o0 + 0x10 ], %o0 _Thread_Enable_dispatch(); 200b254: 40 00 0f f5 call 200f228 <_Thread_Enable_dispatch> 200b258: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EBADF ); 200b25c: 40 00 29 c7 call 2015978 <__errno> 200b260: 01 00 00 00 nop 200b264: 10 80 00 0b b 200b290 <_POSIX_Message_queue_Receive_support+0x78> 200b268: 82 10 20 09 mov 9, %g1 ! 9 } the_mq = the_mq_fd->Queue; if ( msg_len < the_mq->Message_queue.maximum_message_size ) { 200b26c: c4 02 20 68 ld [ %o0 + 0x68 ], %g2 200b270: 80 a6 80 02 cmp %i2, %g2 200b274: 1a 80 00 09 bcc 200b298 <_POSIX_Message_queue_Receive_support+0x80> 200b278: 84 10 3f ff mov -1, %g2 _Thread_Enable_dispatch(); 200b27c: 40 00 0f eb call 200f228 <_Thread_Enable_dispatch> 200b280: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EMSGSIZE ); 200b284: 40 00 29 bd call 2015978 <__errno> 200b288: 01 00 00 00 nop 200b28c: 82 10 20 7a mov 0x7a, %g1 ! 7a 200b290: 10 80 00 27 b 200b32c <_POSIX_Message_queue_Receive_support+0x114> 200b294: 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; 200b298: c4 27 bf fc st %g2, [ %fp + -4 ] /* * A timed receive with a bad time will do a poll regardless. */ if ( wait ) 200b29c: 80 a7 20 00 cmp %i4, 0 200b2a0: 02 80 00 06 be 200b2b8 <_POSIX_Message_queue_Receive_support+0xa0><== NEVER TAKEN 200b2a4: 98 10 20 00 clr %o4 do_wait = (the_mq_fd->oflag & O_NONBLOCK) ? false : true; 200b2a8: 05 00 00 10 sethi %hi(0x4000), %g2 200b2ac: 82 08 40 02 and %g1, %g2, %g1 200b2b0: 80 a0 00 01 cmp %g0, %g1 200b2b4: 98 60 3f ff subx %g0, -1, %o4 do_wait = wait; /* * Now perform the actual message receive */ _CORE_message_queue_Seize( 200b2b8: 9a 10 00 1d mov %i5, %o5 200b2bc: 90 02 20 1c add %o0, 0x1c, %o0 200b2c0: 92 10 00 18 mov %i0, %o1 200b2c4: 94 10 00 19 mov %i1, %o2 200b2c8: 96 07 bf fc add %fp, -4, %o3 200b2cc: 40 00 08 2c call 200d37c <_CORE_message_queue_Seize> 200b2d0: 98 0b 20 01 and %o4, 1, %o4 &length_out, do_wait, timeout ); _Thread_Enable_dispatch(); 200b2d4: 40 00 0f d5 call 200f228 <_Thread_Enable_dispatch> 200b2d8: 3b 00 80 9b sethi %hi(0x2026c00), %i5 *msg_prio = _POSIX_Message_queue_Priority_from_core(_Thread_Executing->Wait.count); 200b2dc: ba 17 60 38 or %i5, 0x38, %i5 ! 2026c38 <_Per_CPU_Information> 200b2e0: 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); 200b2e4: c6 00 60 24 ld [ %g1 + 0x24 ], %g3 if ( !_Thread_Executing->Wait.return_code ) 200b2e8: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 200b2ec: 85 38 e0 1f sra %g3, 0x1f, %g2 200b2f0: 86 18 80 03 xor %g2, %g3, %g3 200b2f4: 84 20 c0 02 sub %g3, %g2, %g2 200b2f8: 80 a0 60 00 cmp %g1, 0 200b2fc: 12 80 00 05 bne 200b310 <_POSIX_Message_queue_Receive_support+0xf8> 200b300: c4 26 c0 00 st %g2, [ %i3 ] return length_out; 200b304: f0 07 bf fc ld [ %fp + -4 ], %i0 200b308: 81 c7 e0 08 ret 200b30c: 81 e8 00 00 restore rtems_set_errno_and_return_minus_one( 200b310: 40 00 29 9a call 2015978 <__errno> 200b314: 01 00 00 00 nop 200b318: c2 07 60 0c ld [ %i5 + 0xc ], %g1 200b31c: b8 10 00 08 mov %o0, %i4 200b320: 40 00 00 9b call 200b58c <_POSIX_Message_queue_Translate_core_message_queue_return_code> 200b324: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 200b328: d0 27 00 00 st %o0, [ %i4 ] 200b32c: 81 c7 e0 08 ret 200b330: 91 e8 3f ff restore %g0, -1, %o0 #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EBADF ); 200b334: 40 00 29 91 call 2015978 <__errno> 200b338: b0 10 3f ff mov -1, %i0 200b33c: 82 10 20 09 mov 9, %g1 200b340: c2 22 00 00 st %g1, [ %o0 ] } 200b344: 81 c7 e0 08 ret 200b348: 81 e8 00 00 restore =============================================================================== 0200b638 <_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 ]; 200b638: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 200b63c: c4 00 60 d8 ld [ %g1 + 0xd8 ], %g2 200b640: 80 a0 a0 00 cmp %g2, 0 200b644: 12 80 00 13 bne 200b690 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x58><== NEVER TAKEN 200b648: 01 00 00 00 nop 200b64c: c4 00 60 dc ld [ %g1 + 0xdc ], %g2 200b650: 80 a0 a0 01 cmp %g2, 1 200b654: 12 80 00 0f bne 200b690 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x58> 200b658: 01 00 00 00 nop thread_support->cancelability_type == PTHREAD_CANCEL_ASYNCHRONOUS && 200b65c: c2 00 60 e0 ld [ %g1 + 0xe0 ], %g1 200b660: 80 a0 60 00 cmp %g1, 0 200b664: 02 80 00 0b be 200b690 <_POSIX_Thread_Evaluate_cancellation_and_enable_dispatch+0x58> 200b668: 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--; 200b66c: 03 00 80 5b sethi %hi(0x2016c00), %g1 200b670: c4 00 63 20 ld [ %g1 + 0x320 ], %g2 ! 2016f20 <_Thread_Dispatch_disable_level> thread_support->cancelation_requested ) { _Thread_Unnest_dispatch(); _POSIX_Thread_Exit( the_thread, PTHREAD_CANCELED ); 200b674: 92 10 3f ff mov -1, %o1 200b678: 84 00 bf ff add %g2, -1, %g2 200b67c: c4 20 63 20 st %g2, [ %g1 + 0x320 ] return _Thread_Dispatch_disable_level; 200b680: c2 00 63 20 ld [ %g1 + 0x320 ], %g1 200b684: 82 13 c0 00 mov %o7, %g1 200b688: 40 00 01 b1 call 200bd4c <_POSIX_Thread_Exit> 200b68c: 9e 10 40 00 mov %g1, %o7 } else _Thread_Enable_dispatch(); 200b690: 82 13 c0 00 mov %o7, %g1 200b694: 7f ff f4 b4 call 2008964 <_Thread_Enable_dispatch> 200b698: 9e 10 40 00 mov %g1, %o7 =============================================================================== 0200c95c <_POSIX_Thread_Translate_sched_param>: int policy, struct sched_param *param, Thread_CPU_budget_algorithms *budget_algorithm, Thread_CPU_budget_algorithm_callout *budget_callout ) { 200c95c: 9d e3 bf a0 save %sp, -96, %sp if ( !_POSIX_Priority_Is_valid( param->sched_priority ) ) 200c960: d0 06 40 00 ld [ %i1 ], %o0 200c964: 7f ff ff f3 call 200c930 <_POSIX_Priority_Is_valid> 200c968: ba 10 00 18 mov %i0, %i5 200c96c: 80 8a 20 ff btst 0xff, %o0 200c970: 02 80 00 11 be 200c9b4 <_POSIX_Thread_Translate_sched_param+0x58><== NEVER TAKEN 200c974: b0 10 20 16 mov 0x16, %i0 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; 200c978: c0 26 80 00 clr [ %i2 ] *budget_callout = NULL; if ( policy == SCHED_OTHER ) { 200c97c: 80 a7 60 00 cmp %i5, 0 200c980: 12 80 00 06 bne 200c998 <_POSIX_Thread_Translate_sched_param+0x3c> 200c984: c0 26 c0 00 clr [ %i3 ] *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 200c988: 82 10 20 01 mov 1, %g1 200c98c: c2 26 80 00 st %g1, [ %i2 ] return 0; 200c990: 81 c7 e0 08 ret 200c994: 91 e8 20 00 restore %g0, 0, %o0 } if ( policy == SCHED_FIFO ) { 200c998: 80 a7 60 01 cmp %i5, 1 200c99c: 02 80 00 06 be 200c9b4 <_POSIX_Thread_Translate_sched_param+0x58> 200c9a0: b0 10 20 00 clr %i0 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_NONE; return 0; } if ( policy == SCHED_RR ) { 200c9a4: 80 a7 60 02 cmp %i5, 2 200c9a8: 32 80 00 05 bne,a 200c9bc <_POSIX_Thread_Translate_sched_param+0x60> 200c9ac: 80 a7 60 04 cmp %i5, 4 *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_EXHAUST_TIMESLICE; 200c9b0: fa 26 80 00 st %i5, [ %i2 ] return 0; 200c9b4: 81 c7 e0 08 ret 200c9b8: 81 e8 00 00 restore } if ( policy == SCHED_SPORADIC ) { 200c9bc: 12 bf ff fe bne 200c9b4 <_POSIX_Thread_Translate_sched_param+0x58> 200c9c0: b0 10 20 16 mov 0x16, %i0 if ( (param->sched_ss_repl_period.tv_sec == 0) && 200c9c4: c2 06 60 08 ld [ %i1 + 8 ], %g1 200c9c8: 80 a0 60 00 cmp %g1, 0 200c9cc: 32 80 00 07 bne,a 200c9e8 <_POSIX_Thread_Translate_sched_param+0x8c> 200c9d0: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200c9d4: c2 06 60 0c ld [ %i1 + 0xc ], %g1 200c9d8: 80 a0 60 00 cmp %g1, 0 200c9dc: 02 80 00 1d be 200ca50 <_POSIX_Thread_Translate_sched_param+0xf4> 200c9e0: 01 00 00 00 nop (param->sched_ss_repl_period.tv_nsec == 0) ) return EINVAL; if ( (param->sched_ss_init_budget.tv_sec == 0) && 200c9e4: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 200c9e8: 80 a0 60 00 cmp %g1, 0 200c9ec: 12 80 00 06 bne 200ca04 <_POSIX_Thread_Translate_sched_param+0xa8> 200c9f0: 01 00 00 00 nop 200c9f4: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200c9f8: 80 a0 60 00 cmp %g1, 0 200c9fc: 02 bf ff ee be 200c9b4 <_POSIX_Thread_Translate_sched_param+0x58> 200ca00: 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 ) < 200ca04: 7f ff f6 2a call 200a2ac <_Timespec_To_ticks> 200ca08: 90 06 60 08 add %i1, 8, %o0 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) return EINVAL; 200ca0c: 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 ) < 200ca10: ba 10 00 08 mov %o0, %i5 _Timespec_To_ticks( ¶m->sched_ss_init_budget ) ) 200ca14: 7f ff f6 26 call 200a2ac <_Timespec_To_ticks> 200ca18: 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 ) < 200ca1c: 80 a7 40 08 cmp %i5, %o0 200ca20: 0a 80 00 0c bcs 200ca50 <_POSIX_Thread_Translate_sched_param+0xf4> 200ca24: 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 ) ) 200ca28: 7f ff ff c2 call 200c930 <_POSIX_Priority_Is_valid> 200ca2c: d0 06 60 04 ld [ %i1 + 4 ], %o0 200ca30: 80 8a 20 ff btst 0xff, %o0 200ca34: 02 bf ff e0 be 200c9b4 <_POSIX_Thread_Translate_sched_param+0x58> 200ca38: 82 10 20 03 mov 3, %g1 return EINVAL; *budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_CALLOUT; 200ca3c: c2 26 80 00 st %g1, [ %i2 ] *budget_callout = _POSIX_Threads_Sporadic_budget_callout; return 0; 200ca40: 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; 200ca44: 03 00 80 19 sethi %hi(0x2006400), %g1 200ca48: 82 10 62 08 or %g1, 0x208, %g1 ! 2006608 <_POSIX_Threads_Sporadic_budget_callout> 200ca4c: c2 26 c0 00 st %g1, [ %i3 ] return 0; } return EINVAL; } 200ca50: 81 c7 e0 08 ret 200ca54: 81 e8 00 00 restore =============================================================================== 02006354 <_POSIX_Threads_Initialize_user_threads_body>: * * Output parameters: NONE */ void _POSIX_Threads_Initialize_user_threads_body(void) { 2006354: 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; 2006358: 03 00 80 71 sethi %hi(0x201c400), %g1 200635c: 82 10 62 44 or %g1, 0x244, %g1 ! 201c644 maximum = Configuration_POSIX_API.number_of_initialization_threads; 2006360: f6 00 60 30 ld [ %g1 + 0x30 ], %i3 if ( !user_threads || maximum == 0 ) 2006364: 80 a6 e0 00 cmp %i3, 0 2006368: 02 80 00 1b be 20063d4 <_POSIX_Threads_Initialize_user_threads_body+0x80><== NEVER TAKEN 200636c: fa 00 60 34 ld [ %g1 + 0x34 ], %i5 2006370: 80 a7 60 00 cmp %i5, 0 2006374: 02 80 00 18 be 20063d4 <_POSIX_Threads_Initialize_user_threads_body+0x80><== NEVER TAKEN 2006378: 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 ); 200637c: 40 00 19 b7 call 200ca58 2006380: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setinheritsched( &attr, PTHREAD_EXPLICIT_SCHED ); 2006384: 92 10 20 02 mov 2, %o1 2006388: 40 00 19 c0 call 200ca88 200638c: 90 07 bf bc add %fp, -68, %o0 (void) pthread_attr_setstacksize(&attr, user_threads[ index ].stack_size); 2006390: d2 07 60 04 ld [ %i5 + 4 ], %o1 2006394: 40 00 19 cc call 200cac4 2006398: 90 07 bf bc add %fp, -68, %o0 status = pthread_create( 200639c: d4 07 40 00 ld [ %i5 ], %o2 20063a0: 90 07 bf fc add %fp, -4, %o0 20063a4: 92 07 bf bc add %fp, -68, %o1 20063a8: 7f ff ff 39 call 200608c 20063ac: 96 10 20 00 clr %o3 &thread_id, &attr, user_threads[ index ].thread_entry, NULL ); if ( status ) 20063b0: 94 92 20 00 orcc %o0, 0, %o2 20063b4: 22 80 00 05 be,a 20063c8 <_POSIX_Threads_Initialize_user_threads_body+0x74> 20063b8: b8 07 20 01 inc %i4 _Internal_error_Occurred( INTERNAL_ERROR_POSIX_API, true, status ); 20063bc: 90 10 20 02 mov 2, %o0 20063c0: 40 00 07 ea call 2008368 <_Internal_error_Occurred> 20063c4: 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++ ) { 20063c8: 80 a7 00 1b cmp %i4, %i3 20063cc: 0a bf ff ec bcs 200637c <_POSIX_Threads_Initialize_user_threads_body+0x28><== NEVER TAKEN 20063d0: ba 07 60 08 add %i5, 8, %i5 20063d4: 81 c7 e0 08 ret 20063d8: 81 e8 00 00 restore =============================================================================== 0200be58 <_POSIX_Threads_Sporadic_budget_TSR>: */ void _POSIX_Threads_Sporadic_budget_TSR( Objects_Id id __attribute__((unused)), void *argument ) { 200be58: 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 ]; 200be5c: 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 ); 200be60: 40 00 03 ca call 200cd88 <_Timespec_To_ticks> 200be64: 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); 200be68: 03 00 80 6e sethi %hi(0x201b800), %g1 200be6c: d2 08 63 dc ldub [ %g1 + 0x3dc ], %o1 ! 201bbdc 200be70: c2 07 60 88 ld [ %i5 + 0x88 ], %g1 the_thread->cpu_time_budget = ticks; 200be74: d0 26 60 78 st %o0, [ %i1 + 0x78 ] 200be78: 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 ) { 200be7c: c2 06 60 1c ld [ %i1 + 0x1c ], %g1 200be80: 80 a0 60 00 cmp %g1, 0 200be84: 12 80 00 08 bne 200bea4 <_POSIX_Threads_Sporadic_budget_TSR+0x4c><== NEVER TAKEN 200be88: 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 ) { 200be8c: c2 06 60 14 ld [ %i1 + 0x14 ], %g1 200be90: 80 a0 40 09 cmp %g1, %o1 200be94: 08 80 00 04 bleu 200bea4 <_POSIX_Threads_Sporadic_budget_TSR+0x4c> 200be98: 90 10 00 19 mov %i1, %o0 _Thread_Change_priority( the_thread, new_priority, true ); 200be9c: 7f ff f2 14 call 20086ec <_Thread_Change_priority> 200bea0: 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 ); 200bea4: 40 00 03 b9 call 200cd88 <_Timespec_To_ticks> 200bea8: 90 07 60 90 add %i5, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200beac: 31 00 80 72 sethi %hi(0x201c800), %i0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200beb0: d0 27 60 b4 st %o0, [ %i5 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200beb4: b0 16 21 c4 or %i0, 0x1c4, %i0 200beb8: 7f ff f6 d1 call 20099fc <_Watchdog_Insert> 200bebc: 93 ef 60 a8 restore %i5, 0xa8, %o1 =============================================================================== 0200bec0 <_POSIX_Threads_Sporadic_budget_callout>: ) { POSIX_API_Control *api; uint32_t new_priority; api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 200bec0: 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 */ 200bec4: 86 10 3f ff mov -1, %g3 200bec8: c4 00 a0 8c ld [ %g2 + 0x8c ], %g2 200becc: c6 22 20 78 st %g3, [ %o0 + 0x78 ] 200bed0: 07 00 80 6e sethi %hi(0x201b800), %g3 200bed4: d2 08 e3 dc ldub [ %g3 + 0x3dc ], %o1 ! 201bbdc 200bed8: 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 ) { 200bedc: c4 02 20 1c ld [ %o0 + 0x1c ], %g2 200bee0: 80 a0 a0 00 cmp %g2, 0 200bee4: 12 80 00 09 bne 200bf08 <_POSIX_Threads_Sporadic_budget_callout+0x48><== NEVER TAKEN 200bee8: 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 ) { 200beec: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200bef0: 80 a0 40 09 cmp %g1, %o1 200bef4: 1a 80 00 05 bcc 200bf08 <_POSIX_Threads_Sporadic_budget_callout+0x48><== NEVER TAKEN 200bef8: 94 10 20 01 mov 1, %o2 _Thread_Change_priority( the_thread, new_priority, true ); 200befc: 82 13 c0 00 mov %o7, %g1 200bf00: 7f ff f1 fb call 20086ec <_Thread_Change_priority> 200bf04: 9e 10 40 00 mov %g1, %o7 200bf08: 81 c3 e0 08 retl <== NOT EXECUTED =============================================================================== 020060f4 <_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) { 20060f4: 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; 20060f8: c2 06 60 68 ld [ %i1 + 0x68 ], %g1 20060fc: 82 00 60 01 inc %g1 2006100: c2 26 60 68 st %g1, [ %i1 + 0x68 ] /* The timer must be reprogrammed */ if ( ( ptimer->timer_data.it_interval.tv_sec != 0 ) || 2006104: c2 06 60 54 ld [ %i1 + 0x54 ], %g1 2006108: 80 a0 60 00 cmp %g1, 0 200610c: 32 80 00 07 bne,a 2006128 <_POSIX_Timer_TSR+0x34> 2006110: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 2006114: c2 06 60 58 ld [ %i1 + 0x58 ], %g1 2006118: 80 a0 60 00 cmp %g1, 0 200611c: 02 80 00 0f be 2006158 <_POSIX_Timer_TSR+0x64> <== NEVER TAKEN 2006120: 82 10 20 04 mov 4, %g1 ( ptimer->timer_data.it_interval.tv_nsec != 0 ) ) { activated = _POSIX_Timer_Insert_helper( 2006124: d2 06 60 64 ld [ %i1 + 0x64 ], %o1 2006128: d4 06 60 08 ld [ %i1 + 8 ], %o2 200612c: 90 06 60 10 add %i1, 0x10, %o0 2006130: 17 00 80 18 sethi %hi(0x2006000), %o3 2006134: 98 10 00 19 mov %i1, %o4 2006138: 40 00 19 5f call 200c6b4 <_POSIX_Timer_Insert_helper> 200613c: 96 12 e0 f4 or %o3, 0xf4, %o3 ptimer->ticks, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) 2006140: 80 8a 20 ff btst 0xff, %o0 2006144: 02 80 00 0a be 200616c <_POSIX_Timer_TSR+0x78> <== NEVER TAKEN 2006148: 01 00 00 00 nop return; /* Store the time when the timer was started again */ _TOD_Get( &ptimer->time ); 200614c: 40 00 05 b4 call 200781c <_TOD_Get> 2006150: 90 06 60 6c add %i1, 0x6c, %o0 2006154: 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 ) ) { 2006158: d0 06 60 38 ld [ %i1 + 0x38 ], %o0 200615c: d2 06 60 44 ld [ %i1 + 0x44 ], %o1 2006160: 40 00 18 42 call 200c268 2006164: 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; 2006168: c0 26 60 68 clr [ %i1 + 0x68 ] 200616c: 81 c7 e0 08 ret 2006170: 81 e8 00 00 restore =============================================================================== 0200e154 <_POSIX_signals_Check_signal>: bool _POSIX_signals_Check_signal( POSIX_API_Control *api, int signo, bool is_global ) { 200e154: 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, 200e158: 98 10 20 01 mov 1, %o4 200e15c: 90 10 00 18 mov %i0, %o0 200e160: 92 10 00 19 mov %i1, %o1 200e164: 94 07 bf f4 add %fp, -12, %o2 200e168: 40 00 00 2e call 200e220 <_POSIX_signals_Clear_signals> 200e16c: 96 10 00 1a mov %i2, %o3 200e170: 80 8a 20 ff btst 0xff, %o0 200e174: 02 80 00 28 be 200e214 <_POSIX_signals_Check_signal+0xc0> 200e178: 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 ) 200e17c: 85 2e 60 02 sll %i1, 2, %g2 200e180: 35 00 80 73 sethi %hi(0x201cc00), %i2 200e184: b7 2e 60 04 sll %i1, 4, %i3 200e188: b4 16 a2 90 or %i2, 0x290, %i2 200e18c: b6 26 c0 02 sub %i3, %g2, %i3 200e190: 84 06 80 1b add %i2, %i3, %g2 200e194: fa 00 a0 08 ld [ %g2 + 8 ], %i5 200e198: 80 a7 60 01 cmp %i5, 1 200e19c: 02 80 00 1e be 200e214 <_POSIX_signals_Check_signal+0xc0> <== NEVER TAKEN 200e1a0: 90 07 bf cc add %fp, -52, %o0 return false; /* * Block the signals requested in sa_mask */ saved_signals_blocked = api->signals_blocked; 200e1a4: f8 06 20 d0 ld [ %i0 + 0xd0 ], %i4 api->signals_blocked |= _POSIX_signals_Vectors[ signo ].sa_mask; 200e1a8: c2 00 a0 04 ld [ %g2 + 4 ], %g1 200e1ac: 82 10 40 1c or %g1, %i4, %g1 200e1b0: 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, 200e1b4: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e1b8: d2 00 62 44 ld [ %g1 + 0x244 ], %o1 ! 201ce44 <_Per_CPU_Information+0xc> 200e1bc: 94 10 20 28 mov 0x28, %o2 200e1c0: 40 00 04 3a call 200f2a8 200e1c4: 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 ) { 200e1c8: c2 06 80 1b ld [ %i2 + %i3 ], %g1 200e1cc: 80 a0 60 02 cmp %g1, 2 200e1d0: 12 80 00 07 bne 200e1ec <_POSIX_signals_Check_signal+0x98> 200e1d4: 90 10 00 19 mov %i1, %o0 case SA_SIGINFO: (*_POSIX_signals_Vectors[ signo ].sa_sigaction)( 200e1d8: 92 07 bf f4 add %fp, -12, %o1 200e1dc: 9f c7 40 00 call %i5 200e1e0: 94 10 20 00 clr %o2 signo, &siginfo_struct, NULL /* context is undefined per 1003.1b-1993, p. 66 */ ); break; 200e1e4: 10 80 00 05 b 200e1f8 <_POSIX_signals_Check_signal+0xa4> 200e1e8: 03 00 80 73 sethi %hi(0x201cc00), %g1 default: (*_POSIX_signals_Vectors[ signo ].sa_handler)( signo ); 200e1ec: 9f c7 40 00 call %i5 200e1f0: 01 00 00 00 nop } /* * Restore the blocking information */ memcpy( &_Thread_Executing->Wait, &stored_thread_wait_information, 200e1f4: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e1f8: d0 00 62 44 ld [ %g1 + 0x244 ], %o0 ! 201ce44 <_Per_CPU_Information+0xc> 200e1fc: 92 07 bf cc add %fp, -52, %o1 200e200: 90 02 20 20 add %o0, 0x20, %o0 200e204: 40 00 04 29 call 200f2a8 200e208: 94 10 20 28 mov 0x28, %o2 /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; return true; 200e20c: 82 10 20 01 mov 1, %g1 sizeof( Thread_Wait_information )); /* * Restore the previous set of blocked signals */ api->signals_blocked = saved_signals_blocked; 200e210: f8 26 20 d0 st %i4, [ %i0 + 0xd0 ] return true; } 200e214: b0 08 60 01 and %g1, 1, %i0 200e218: 81 c7 e0 08 ret 200e21c: 81 e8 00 00 restore =============================================================================== 0200e8b0 <_POSIX_signals_Clear_process_signals>: */ void _POSIX_signals_Clear_process_signals( int signo ) { 200e8b0: 9d e3 bf a0 save %sp, -96, %sp clear_signal = true; mask = signo_to_mask( signo ); ISR_Level level; _ISR_Disable( level ); 200e8b4: 7f ff ce 16 call 200210c 200e8b8: 01 00 00 00 nop if ( _POSIX_signals_Vectors[ signo ].sa_flags == SA_SIGINFO ) { 200e8bc: 85 2e 20 04 sll %i0, 4, %g2 200e8c0: 83 2e 20 02 sll %i0, 2, %g1 200e8c4: 82 20 80 01 sub %g2, %g1, %g1 200e8c8: 05 00 80 73 sethi %hi(0x201cc00), %g2 200e8cc: 84 10 a2 90 or %g2, 0x290, %g2 ! 201ce90 <_POSIX_signals_Vectors> 200e8d0: c4 00 80 01 ld [ %g2 + %g1 ], %g2 200e8d4: 80 a0 a0 02 cmp %g2, 2 200e8d8: 12 80 00 0a bne 200e900 <_POSIX_signals_Clear_process_signals+0x50> 200e8dc: 84 10 20 01 mov 1, %g2 if ( !_Chain_Is_empty( &_POSIX_signals_Siginfo[ signo ] ) ) 200e8e0: 05 00 80 74 sethi %hi(0x201d000), %g2 200e8e4: 84 10 a0 88 or %g2, 0x88, %g2 ! 201d088 <_POSIX_signals_Siginfo> 200e8e8: 86 00 40 02 add %g1, %g2, %g3 200e8ec: 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 ); 200e8f0: 86 00 e0 04 add %g3, 4, %g3 200e8f4: 80 a0 40 03 cmp %g1, %g3 200e8f8: 12 80 00 08 bne 200e918 <_POSIX_signals_Clear_process_signals+0x68><== NEVER TAKEN 200e8fc: 84 10 20 01 mov 1, %g2 clear_signal = false; } if ( clear_signal ) { _POSIX_signals_Pending &= ~mask; 200e900: 03 00 80 74 sethi %hi(0x201d000), %g1 200e904: b0 06 3f ff add %i0, -1, %i0 200e908: b1 28 80 18 sll %g2, %i0, %i0 200e90c: c4 00 60 84 ld [ %g1 + 0x84 ], %g2 200e910: b0 28 80 18 andn %g2, %i0, %i0 200e914: f0 20 60 84 st %i0, [ %g1 + 0x84 ] } _ISR_Enable( level ); 200e918: 7f ff ce 01 call 200211c 200e91c: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02006b28 <_POSIX_signals_Get_lowest>: sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 2006b28: 82 10 20 1b mov 0x1b, %g1 2006b2c: 84 10 20 01 mov 1, %g2 #include #include #include #include int _POSIX_signals_Get_lowest( 2006b30: 86 00 7f ff add %g1, -1, %g3 2006b34: 87 28 80 03 sll %g2, %g3, %g3 ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { if ( set & signo_to_mask( signo ) ) { 2006b38: 80 88 c0 08 btst %g3, %o0 2006b3c: 12 80 00 11 bne 2006b80 <_POSIX_signals_Get_lowest+0x58> <== NEVER TAKEN 2006b40: 01 00 00 00 nop sigset_t set ) { int signo; for ( signo = SIGRTMIN ; signo <= SIGRTMAX ; signo++ ) { 2006b44: 82 00 60 01 inc %g1 2006b48: 80 a0 60 20 cmp %g1, 0x20 2006b4c: 12 bf ff fa bne 2006b34 <_POSIX_signals_Get_lowest+0xc> 2006b50: 86 00 7f ff add %g1, -1, %g3 2006b54: 82 10 20 01 mov 1, %g1 2006b58: 84 10 20 01 mov 1, %g2 #include #include #include #include int _POSIX_signals_Get_lowest( 2006b5c: 86 00 7f ff add %g1, -1, %g3 2006b60: 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 ) ) { 2006b64: 80 88 c0 08 btst %g3, %o0 2006b68: 12 80 00 06 bne 2006b80 <_POSIX_signals_Get_lowest+0x58> 2006b6c: 01 00 00 00 nop */ #if (SIGHUP != 1) #error "Assumption that SIGHUP==1 violated!!" #endif for ( signo = SIGHUP ; signo <= __SIGLASTNOTRT ; signo++ ) { 2006b70: 82 00 60 01 inc %g1 2006b74: 80 a0 60 1b cmp %g1, 0x1b 2006b78: 12 bf ff fa bne 2006b60 <_POSIX_signals_Get_lowest+0x38> <== ALWAYS TAKEN 2006b7c: 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; } 2006b80: 81 c3 e0 08 retl 2006b84: 90 10 00 01 mov %g1, %o0 =============================================================================== 020196c0 <_POSIX_signals_Unblock_thread>: bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 20196c0: 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 ) ) { 20196c4: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 20196c8: 3b 04 00 20 sethi %hi(0x10008000), %i5 static inline sigset_t signo_to_mask( uint32_t sig ) { return 1u << (sig - 1); 20196cc: 84 06 7f ff add %i1, -1, %g2 20196d0: 86 10 20 01 mov 1, %g3 20196d4: 9e 08 40 1d and %g1, %i5, %o7 bool _POSIX_signals_Unblock_thread( Thread_Control *the_thread, int signo, siginfo_t *info ) { 20196d8: 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 ]; 20196dc: 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 ) ) { 20196e0: 80 a3 c0 1d cmp %o7, %i5 20196e4: 12 80 00 1c bne 2019754 <_POSIX_signals_Unblock_thread+0x94> 20196e8: 85 28 c0 02 sll %g3, %g2, %g2 if ( (the_thread->Wait.option & mask) || (~api->signals_blocked & mask) ) { 20196ec: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 20196f0: 80 88 80 01 btst %g2, %g1 20196f4: 12 80 00 07 bne 2019710 <_POSIX_signals_Unblock_thread+0x50> 20196f8: 82 10 20 04 mov 4, %g1 20196fc: c2 01 20 d0 ld [ %g4 + 0xd0 ], %g1 2019700: 80 a8 80 01 andncc %g2, %g1, %g0 2019704: 02 80 00 3f be 2019800 <_POSIX_signals_Unblock_thread+0x140> 2019708: ba 10 20 00 clr %i5 the_thread->Wait.return_code = EINTR; 201970c: 82 10 20 04 mov 4, %g1 2019710: c2 26 20 34 st %g1, [ %i0 + 0x34 ] the_info = (siginfo_t *) the_thread->Wait.return_argument; if ( !info ) { 2019714: 80 a2 60 00 cmp %o1, 0 2019718: 12 80 00 07 bne 2019734 <_POSIX_signals_Unblock_thread+0x74> 201971c: d0 06 20 28 ld [ %i0 + 0x28 ], %o0 the_info->si_signo = signo; the_info->si_code = SI_USER; 2019720: 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; 2019724: f2 22 00 00 st %i1, [ %o0 ] the_info->si_code = SI_USER; 2019728: c2 22 20 04 st %g1, [ %o0 + 4 ] the_info->si_value.sival_int = 0; 201972c: 10 80 00 04 b 201973c <_POSIX_signals_Unblock_thread+0x7c> 2019730: c0 22 20 08 clr [ %o0 + 8 ] } else { *the_info = *info; 2019734: 7f ff d6 dd call 200f2a8 2019738: 94 10 20 0c mov 0xc, %o2 } _Thread_queue_Extract_with_proxy( the_thread ); 201973c: 90 10 00 18 mov %i0, %o0 2019740: 7f ff be d7 call 200929c <_Thread_queue_Extract_with_proxy> 2019744: ba 10 20 01 mov 1, %i5 2019748: b0 0f 60 01 and %i5, 1, %i0 201974c: 81 c7 e0 08 ret 2019750: 81 e8 00 00 restore } /* * Thread is not waiting due to a sigwait. */ if ( ~api->signals_blocked & mask ) { 2019754: c8 01 20 d0 ld [ %g4 + 0xd0 ], %g4 2019758: 80 a8 80 04 andncc %g2, %g4, %g0 201975c: 02 80 00 29 be 2019800 <_POSIX_signals_Unblock_thread+0x140> 2019760: 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 ) ) { 2019764: 05 04 00 00 sethi %hi(0x10000000), %g2 2019768: 80 88 40 02 btst %g1, %g2 201976c: 02 80 00 19 be 20197d0 <_POSIX_signals_Unblock_thread+0x110> 2019770: 80 a0 60 00 cmp %g1, 0 the_thread->Wait.return_code = EINTR; 2019774: 84 10 20 04 mov 4, %g2 2019778: 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) ) 201977c: 05 00 00 ef sethi %hi(0x3bc00), %g2 2019780: 84 10 a2 e0 or %g2, 0x2e0, %g2 ! 3bee0 2019784: 80 88 40 02 btst %g1, %g2 2019788: 02 80 00 07 be 20197a4 <_POSIX_signals_Unblock_thread+0xe4> 201978c: 80 88 60 08 btst 8, %g1 _Thread_queue_Extract_with_proxy( the_thread ); 2019790: 7f ff be c3 call 200929c <_Thread_queue_Extract_with_proxy> 2019794: 90 10 00 18 mov %i0, %o0 2019798: b0 0f 60 01 and %i5, 1, %i0 201979c: 81 c7 e0 08 ret 20197a0: 81 e8 00 00 restore else if ( _States_Is_delaying(the_thread->current_state) ) { 20197a4: 22 80 00 18 be,a 2019804 <_POSIX_signals_Unblock_thread+0x144><== NEVER TAKEN 20197a8: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED (void) _Watchdog_Remove( &the_thread->Timer ); 20197ac: 7f ff c0 ee call 2009b64 <_Watchdog_Remove> 20197b0: 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 ); 20197b4: 90 10 00 18 mov %i0, %o0 20197b8: 13 04 00 ff sethi %hi(0x1003fc00), %o1 20197bc: 7f ff bc 12 call 2008804 <_Thread_Clear_state> 20197c0: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 20197c4: b0 0f 60 01 and %i5, 1, %i0 20197c8: 81 c7 e0 08 ret 20197cc: 81 e8 00 00 restore _Thread_Unblock( the_thread ); } } else if ( the_thread->current_state == STATES_READY ) { 20197d0: 32 80 00 0d bne,a 2019804 <_POSIX_signals_Unblock_thread+0x144><== NEVER TAKEN 20197d4: b0 0f 60 01 and %i5, 1, %i0 <== NOT EXECUTED if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 20197d8: 03 00 80 73 sethi %hi(0x201cc00), %g1 20197dc: 82 10 62 38 or %g1, 0x238, %g1 ! 201ce38 <_Per_CPU_Information> 20197e0: c4 00 60 08 ld [ %g1 + 8 ], %g2 20197e4: 80 a0 a0 00 cmp %g2, 0 20197e8: 22 80 00 07 be,a 2019804 <_POSIX_signals_Unblock_thread+0x144> 20197ec: b0 0f 60 01 and %i5, 1, %i0 20197f0: c4 00 60 0c ld [ %g1 + 0xc ], %g2 20197f4: 80 a6 00 02 cmp %i0, %g2 20197f8: 22 80 00 02 be,a 2019800 <_POSIX_signals_Unblock_thread+0x140><== ALWAYS TAKEN 20197fc: c6 28 60 18 stb %g3, [ %g1 + 0x18 ] _Thread_Dispatch_necessary = true; } } return false; } 2019800: b0 0f 60 01 and %i5, 1, %i0 2019804: 81 c7 e0 08 ret 2019808: 81 e8 00 00 restore =============================================================================== 02008768 <_RBTree_Extract_unprotected>: */ void _RBTree_Extract_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 2008768: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *leaf, *target; RBTree_Color victim_color; RBTree_Direction dir; if(!the_node) return; 200876c: 80 a6 60 00 cmp %i1, 0 2008770: 02 80 00 77 be 200894c <_RBTree_Extract_unprotected+0x1e4> 2008774: 01 00 00 00 nop /* check if min needs to be updated */ if (the_node == the_rbtree->first[RBT_LEFT]) { 2008778: c2 06 20 08 ld [ %i0 + 8 ], %g1 200877c: 80 a6 40 01 cmp %i1, %g1 2008780: 32 80 00 0d bne,a 20087b4 <_RBTree_Extract_unprotected+0x4c> 2008784: c2 06 20 0c ld [ %i0 + 0xc ], %g1 if (the_node->child[RBT_RIGHT]) 2008788: c2 06 60 08 ld [ %i1 + 8 ], %g1 200878c: 80 a0 60 00 cmp %g1, 0 2008790: 22 80 00 04 be,a 20087a0 <_RBTree_Extract_unprotected+0x38> 2008794: c2 06 40 00 ld [ %i1 ], %g1 the_rbtree->first[RBT_LEFT] = the_node->child[RBT_RIGHT]; 2008798: 10 80 00 06 b 20087b0 <_RBTree_Extract_unprotected+0x48> 200879c: 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, 20087a0: 80 a6 00 01 cmp %i0, %g1 20087a4: 12 80 00 03 bne 20087b0 <_RBTree_Extract_unprotected+0x48> 20087a8: c2 26 20 08 st %g1, [ %i0 + 8 ] the_rbtree->first[RBT_LEFT])) the_rbtree->first[RBT_LEFT] = NULL; 20087ac: 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]) { 20087b0: c2 06 20 0c ld [ %i0 + 0xc ], %g1 20087b4: 80 a6 40 01 cmp %i1, %g1 20087b8: 12 80 00 0b bne 20087e4 <_RBTree_Extract_unprotected+0x7c> 20087bc: c2 06 60 04 ld [ %i1 + 4 ], %g1 if (the_node->child[RBT_LEFT]) 20087c0: 80 a0 60 00 cmp %g1, 0 20087c4: 22 80 00 04 be,a 20087d4 <_RBTree_Extract_unprotected+0x6c> 20087c8: c4 06 40 00 ld [ %i1 ], %g2 the_rbtree->first[RBT_RIGHT] = the_node->child[RBT_LEFT]; 20087cc: 10 80 00 06 b 20087e4 <_RBTree_Extract_unprotected+0x7c> 20087d0: 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, 20087d4: 80 a6 00 02 cmp %i0, %g2 20087d8: 12 80 00 03 bne 20087e4 <_RBTree_Extract_unprotected+0x7c> 20087dc: c4 26 20 0c st %g2, [ %i0 + 0xc ] the_rbtree->first[RBT_RIGHT])) the_rbtree->first[RBT_RIGHT] = NULL; 20087e0: 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]) { 20087e4: ba 90 60 00 orcc %g1, 0, %i5 20087e8: 02 80 00 32 be 20088b0 <_RBTree_Extract_unprotected+0x148> 20087ec: f8 06 60 08 ld [ %i1 + 8 ], %i4 20087f0: 80 a7 20 00 cmp %i4, 0 20087f4: 32 80 00 05 bne,a 2008808 <_RBTree_Extract_unprotected+0xa0><== NEVER TAKEN 20087f8: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED 20087fc: 10 80 00 31 b 20088c0 <_RBTree_Extract_unprotected+0x158> 2008800: 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]; 2008804: c2 07 60 08 ld [ %i5 + 8 ], %g1 <== NOT EXECUTED 2008808: 80 a0 60 00 cmp %g1, 0 <== NOT EXECUTED 200880c: 32 bf ff fe bne,a 2008804 <_RBTree_Extract_unprotected+0x9c><== NOT EXECUTED 2008810: ba 10 00 01 mov %g1, %i5 <== NOT EXECUTED * target's position (target is the right child of target->parent) * when target vacates it. if there is no child, then target->parent * should become NULL. This may cause the coloring to be violated. * For now we store the color of the node being deleted in victim_color. */ leaf = target->child[RBT_LEFT]; 2008814: f8 07 60 04 ld [ %i5 + 4 ], %i4 <== NOT EXECUTED if(leaf) { 2008818: 80 a7 20 00 cmp %i4, 0 <== NOT EXECUTED 200881c: 02 80 00 05 be 2008830 <_RBTree_Extract_unprotected+0xc8> <== NOT EXECUTED 2008820: 01 00 00 00 nop <== NOT EXECUTED leaf->parent = target->parent; 2008824: c2 07 40 00 ld [ %i5 ], %g1 <== NOT EXECUTED 2008828: 10 80 00 04 b 2008838 <_RBTree_Extract_unprotected+0xd0> <== NOT EXECUTED 200882c: 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); 2008830: 7f ff ff 50 call 2008570 <_RBTree_Extract_validate_unprotected><== NOT EXECUTED 2008834: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED } victim_color = target->color; dir = target != target->parent->child[0]; 2008838: c4 07 40 00 ld [ %i5 ], %g2 <== NOT EXECUTED leaf->parent = target->parent; } else { /* fix the tree here if the child is a null leaf. */ _RBTree_Extract_validate_unprotected(target); } victim_color = target->color; 200883c: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 <== NOT EXECUTED dir = target != target->parent->child[0]; 2008840: c6 00 a0 04 ld [ %g2 + 4 ], %g3 <== NOT EXECUTED 2008844: 86 1f 40 03 xor %i5, %g3, %g3 <== NOT EXECUTED 2008848: 80 a0 00 03 cmp %g0, %g3 <== NOT EXECUTED 200884c: 86 40 20 00 addx %g0, 0, %g3 <== NOT EXECUTED target->parent->child[dir] = leaf; 2008850: 87 28 e0 02 sll %g3, 2, %g3 <== NOT EXECUTED 2008854: 84 00 80 03 add %g2, %g3, %g2 <== NOT EXECUTED 2008858: f8 20 a0 04 st %i4, [ %g2 + 4 ] <== NOT EXECUTED /* now replace the_node with target */ dir = the_node != the_node->parent->child[0]; 200885c: c4 06 40 00 ld [ %i1 ], %g2 <== NOT EXECUTED 2008860: c6 00 a0 04 ld [ %g2 + 4 ], %g3 <== NOT EXECUTED 2008864: 86 1e 40 03 xor %i1, %g3, %g3 <== NOT EXECUTED 2008868: 80 a0 00 03 cmp %g0, %g3 <== NOT EXECUTED 200886c: 86 40 20 00 addx %g0, 0, %g3 <== NOT EXECUTED the_node->parent->child[dir] = target; 2008870: 87 28 e0 02 sll %g3, 2, %g3 <== NOT EXECUTED 2008874: 84 00 80 03 add %g2, %g3, %g2 <== NOT EXECUTED 2008878: fa 20 a0 04 st %i5, [ %g2 + 4 ] <== NOT EXECUTED /* set target's new children to the original node's children */ target->child[RBT_RIGHT] = the_node->child[RBT_RIGHT]; 200887c: c4 06 60 08 ld [ %i1 + 8 ], %g2 <== NOT EXECUTED 2008880: c4 27 60 08 st %g2, [ %i5 + 8 ] <== NOT EXECUTED the_node->child[RBT_RIGHT]->parent = target; 2008884: c4 06 60 08 ld [ %i1 + 8 ], %g2 <== NOT EXECUTED 2008888: fa 20 80 00 st %i5, [ %g2 ] <== NOT EXECUTED target->child[RBT_LEFT] = the_node->child[RBT_LEFT]; 200888c: c4 06 60 04 ld [ %i1 + 4 ], %g2 <== NOT EXECUTED 2008890: c4 27 60 04 st %g2, [ %i5 + 4 ] <== NOT EXECUTED the_node->child[RBT_LEFT]->parent = target; 2008894: c4 06 60 04 ld [ %i1 + 4 ], %g2 <== NOT EXECUTED 2008898: fa 20 80 00 st %i5, [ %g2 ] <== NOT EXECUTED /* finally, update the parent node and recolor. target has completely * replaced the_node, and target's child has moved up the tree if needed. * the_node is no longer part of the tree, although it has valid pointers * still. */ target->parent = the_node->parent; 200889c: c4 06 40 00 ld [ %i1 ], %g2 <== NOT EXECUTED 20088a0: c4 27 40 00 st %g2, [ %i5 ] <== NOT EXECUTED target->color = the_node->color; 20088a4: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 <== NOT EXECUTED 20088a8: 10 80 00 14 b 20088f8 <_RBTree_Extract_unprotected+0x190> <== NOT EXECUTED 20088ac: c4 27 60 10 st %g2, [ %i5 + 0x10 ] <== NOT EXECUTED * 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 ) { 20088b0: 80 a7 20 00 cmp %i4, 0 20088b4: 32 80 00 04 bne,a 20088c4 <_RBTree_Extract_unprotected+0x15c> 20088b8: c2 06 40 00 ld [ %i1 ], %g1 20088bc: 30 80 00 04 b,a 20088cc <_RBTree_Extract_unprotected+0x164> leaf->parent = the_node->parent; 20088c0: c2 06 40 00 ld [ %i1 ], %g1 20088c4: 10 80 00 04 b 20088d4 <_RBTree_Extract_unprotected+0x16c> 20088c8: 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); 20088cc: 7f ff ff 29 call 2008570 <_RBTree_Extract_validate_unprotected> 20088d0: 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]; 20088d4: 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; 20088d8: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 /* remove the_node from the tree */ dir = the_node != the_node->parent->child[0]; 20088dc: c6 00 a0 04 ld [ %g2 + 4 ], %g3 20088e0: 86 1e 40 03 xor %i1, %g3, %g3 20088e4: 80 a0 00 03 cmp %g0, %g3 20088e8: 86 40 20 00 addx %g0, 0, %g3 the_node->parent->child[dir] = leaf; 20088ec: 87 28 e0 02 sll %g3, 2, %g3 20088f0: 84 00 80 03 add %g2, %g3, %g2 20088f4: 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 */ 20088f8: 80 a0 60 00 cmp %g1, 0 20088fc: 32 80 00 0e bne,a 2008934 <_RBTree_Extract_unprotected+0x1cc> 2008900: c2 06 20 04 ld [ %i0 + 4 ], %g1 2008904: 80 a7 20 00 cmp %i4, 0 2008908: 22 80 00 0b be,a 2008934 <_RBTree_Extract_unprotected+0x1cc> 200890c: c2 06 20 04 ld [ %i0 + 4 ], %g1 2008910: c2 07 20 10 ld [ %i4 + 0x10 ], %g1 2008914: 80 a0 60 01 cmp %g1, 1 2008918: 12 80 00 04 bne 2008928 <_RBTree_Extract_unprotected+0x1c0><== NEVER TAKEN 200891c: 01 00 00 00 nop if (_RBTree_Is_red(leaf)) leaf->color = RBT_BLACK; /* case 2 */ 2008920: 10 80 00 04 b 2008930 <_RBTree_Extract_unprotected+0x1c8> 2008924: c0 27 20 10 clr [ %i4 + 0x10 ] else if(leaf) _RBTree_Extract_validate_unprotected(leaf); /* case 3 */ 2008928: 7f ff ff 12 call 2008570 <_RBTree_Extract_validate_unprotected><== NOT EXECUTED 200892c: 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; 2008930: 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; 2008934: c0 26 60 08 clr [ %i1 + 8 ] 2008938: c0 26 60 04 clr [ %i1 + 4 ] 200893c: 80 a0 60 00 cmp %g1, 0 2008940: 02 80 00 03 be 200894c <_RBTree_Extract_unprotected+0x1e4> 2008944: c0 26 40 00 clr [ %i1 ] 2008948: c0 20 60 10 clr [ %g1 + 0x10 ] 200894c: 81 c7 e0 08 ret 2008950: 81 e8 00 00 restore =============================================================================== 02008570 <_RBTree_Extract_validate_unprotected>: * of the extract operation. */ void _RBTree_Extract_validate_unprotected( RBTree_Node *the_node ) { 2008570: 9d e3 bf a0 save %sp, -96, %sp RBTree_Node *parent, *sibling; RBTree_Direction dir; parent = the_node->parent; 2008574: fa 06 00 00 ld [ %i0 ], %i5 if(!parent->parent) return; 2008578: c2 07 40 00 ld [ %i5 ], %g1 200857c: 80 a0 60 00 cmp %g1, 0 2008580: 02 80 00 71 be 2008744 <_RBTree_Extract_validate_unprotected+0x1d4> 2008584: 90 10 00 18 mov %i0, %o0 sibling = _RBTree_Sibling(the_node); 2008588: 7f ff ff ca call 20084b0 <_RBTree_Sibling> 200858c: 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) { 2008590: 10 80 00 60 b 2008710 <_RBTree_Extract_validate_unprotected+0x1a0> 2008594: 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); 2008598: 22 80 00 5e be,a 2008710 <_RBTree_Extract_validate_unprotected+0x1a0><== NEVER TAKEN 200859c: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 <== NOT EXECUTED 20085a0: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 20085a4: 80 a0 60 01 cmp %g1, 1 20085a8: 32 80 00 14 bne,a 20085f8 <_RBTree_Extract_validate_unprotected+0x88> 20085ac: 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; 20085b0: c2 27 60 10 st %g1, [ %i5 + 0x10 ] sibling->color = RBT_BLACK; dir = the_node != parent->child[0]; 20085b4: 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; 20085b8: c0 22 20 10 clr [ %o0 + 0x10 ] dir = the_node != parent->child[0]; 20085bc: 82 1e 00 01 xor %i0, %g1, %g1 20085c0: 80 a0 00 01 cmp %g0, %g1 _RBTree_Rotate(parent, dir); 20085c4: 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]; 20085c8: b8 40 20 00 addx %g0, 0, %i4 _RBTree_Rotate(parent, dir); 20085cc: 7f ff ff ca call 20084f4 <_RBTree_Rotate> 20085d0: 92 10 00 1c mov %i4, %o1 sibling = parent->child[!dir]; 20085d4: 80 a0 00 1c cmp %g0, %i4 20085d8: 82 60 3f ff subx %g0, -1, %g1 20085dc: 83 28 60 02 sll %g1, 2, %g1 20085e0: 82 07 40 01 add %i5, %g1, %g1 20085e4: d0 00 60 04 ld [ %g1 + 4 ], %o0 } /* sibling is black, see if both of its children are also black. */ if (sibling && 20085e8: 80 a2 20 00 cmp %o0, 0 20085ec: 22 80 00 49 be,a 2008710 <_RBTree_Extract_validate_unprotected+0x1a0><== NEVER TAKEN 20085f0: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 <== NOT EXECUTED !_RBTree_Is_red(sibling->child[RBT_RIGHT]) && 20085f4: c4 02 20 08 ld [ %o0 + 8 ], %g2 20085f8: 80 a0 a0 00 cmp %g2, 0 20085fc: 02 80 00 06 be 2008614 <_RBTree_Extract_validate_unprotected+0xa4> 2008600: 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( 2008604: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 2008608: 82 18 60 01 xor %g1, 1, %g1 200860c: 80 a0 00 01 cmp %g0, %g1 2008610: 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 && 2008614: 80 a0 60 00 cmp %g1, 0 2008618: 32 80 00 14 bne,a 2008668 <_RBTree_Extract_validate_unprotected+0xf8> 200861c: c2 07 60 04 ld [ %i5 + 4 ], %g1 !_RBTree_Is_red(sibling->child[RBT_RIGHT]) && !_RBTree_Is_red(sibling->child[RBT_LEFT])) { 2008620: c4 02 20 04 ld [ %o0 + 4 ], %g2 2008624: 80 a0 a0 00 cmp %g2, 0 2008628: 02 80 00 07 be 2008644 <_RBTree_Extract_validate_unprotected+0xd4> 200862c: 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( 2008630: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 2008634: 82 18 60 01 xor %g1, 1, %g1 2008638: 80 a0 00 01 cmp %g0, %g1 200863c: 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]) && 2008640: 80 a0 60 00 cmp %g1, 0 2008644: 32 80 00 09 bne,a 2008668 <_RBTree_Extract_validate_unprotected+0xf8> 2008648: c2 07 60 04 ld [ %i5 + 4 ], %g1 !_RBTree_Is_red(sibling->child[RBT_LEFT])) { sibling->color = RBT_RED; 200864c: f4 22 20 10 st %i2, [ %o0 + 0x10 ] 2008650: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 2008654: 80 a0 60 01 cmp %g1, 1 2008658: 32 80 00 3d bne,a 200874c <_RBTree_Extract_validate_unprotected+0x1dc> 200865c: f8 07 40 00 ld [ %i5 ], %i4 if (_RBTree_Is_red(parent)) { parent->color = RBT_BLACK; break; 2008660: 10 80 00 33 b 200872c <_RBTree_Extract_validate_unprotected+0x1bc> 2008664: 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]; 2008668: 82 1e 00 01 xor %i0, %g1, %g1 200866c: 80 a0 00 01 cmp %g0, %g1 2008670: b8 40 20 00 addx %g0, 0, %i4 if (!_RBTree_Is_red(sibling->child[!dir])) { 2008674: 80 a0 00 1c cmp %g0, %i4 2008678: b6 60 3f ff subx %g0, -1, %i3 200867c: 83 2e e0 02 sll %i3, 2, %g1 2008680: 82 02 00 01 add %o0, %g1, %g1 2008684: c4 00 60 04 ld [ %g1 + 4 ], %g2 2008688: 80 a0 a0 00 cmp %g2, 0 200868c: 02 80 00 06 be 20086a4 <_RBTree_Extract_validate_unprotected+0x134> 2008690: 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( 2008694: c2 00 a0 10 ld [ %g2 + 0x10 ], %g1 2008698: 82 18 60 01 xor %g1, 1, %g1 200869c: 80 a0 00 01 cmp %g0, %g1 20086a0: 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])) { 20086a4: 80 a0 60 00 cmp %g1, 0 20086a8: 32 80 00 0e bne,a 20086e0 <_RBTree_Extract_validate_unprotected+0x170> 20086ac: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 sibling->color = RBT_RED; 20086b0: 82 10 20 01 mov 1, %g1 20086b4: c2 22 20 10 st %g1, [ %o0 + 0x10 ] sibling->child[dir]->color = RBT_BLACK; 20086b8: 83 2f 20 02 sll %i4, 2, %g1 20086bc: 82 02 00 01 add %o0, %g1, %g1 20086c0: c2 00 60 04 ld [ %g1 + 4 ], %g1 _RBTree_Rotate(sibling, !dir); 20086c4: 92 1f 20 01 xor %i4, 1, %o1 20086c8: 7f ff ff 8b call 20084f4 <_RBTree_Rotate> 20086cc: c0 20 60 10 clr [ %g1 + 0x10 ] sibling = parent->child[!dir]; 20086d0: 83 2e e0 02 sll %i3, 2, %g1 20086d4: 82 07 40 01 add %i5, %g1, %g1 20086d8: d0 00 60 04 ld [ %g1 + 4 ], %o0 } sibling->color = parent->color; 20086dc: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 parent->color = RBT_BLACK; sibling->child[!dir]->color = RBT_BLACK; 20086e0: 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; 20086e4: c2 22 20 10 st %g1, [ %o0 + 0x10 ] parent->color = RBT_BLACK; sibling->child[!dir]->color = RBT_BLACK; 20086e8: 90 02 00 1b add %o0, %i3, %o0 20086ec: 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; 20086f0: c0 27 60 10 clr [ %i5 + 0x10 ] sibling->child[!dir]->color = RBT_BLACK; 20086f4: c0 20 60 10 clr [ %g1 + 0x10 ] _RBTree_Rotate(parent, dir); 20086f8: 90 10 00 1d mov %i5, %o0 20086fc: 7f ff ff 7e call 20084f4 <_RBTree_Rotate> 2008700: 92 10 00 1c mov %i4, %o1 break; /* done */ 2008704: 10 80 00 0b b 2008730 <_RBTree_Extract_validate_unprotected+0x1c0> 2008708: 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) { 200870c: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 2008710: 80 a0 60 01 cmp %g1, 1 2008714: 22 80 00 07 be,a 2008730 <_RBTree_Extract_validate_unprotected+0x1c0> 2008718: c2 06 00 00 ld [ %i0 ], %g1 200871c: c2 07 40 00 ld [ %i5 ], %g1 2008720: 80 a0 60 00 cmp %g1, 0 2008724: 12 bf ff 9d bne 2008598 <_RBTree_Extract_validate_unprotected+0x28> 2008728: 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; 200872c: c2 06 00 00 ld [ %i0 ], %g1 2008730: c2 00 40 00 ld [ %g1 ], %g1 2008734: 80 a0 60 00 cmp %g1, 0 2008738: 12 80 00 0a bne 2008760 <_RBTree_Extract_validate_unprotected+0x1f0> 200873c: 01 00 00 00 nop 2008740: c0 26 20 10 clr [ %i0 + 0x10 ] 2008744: 81 c7 e0 08 ret 2008748: 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); 200874c: 90 10 00 1d mov %i5, %o0 2008750: 7f ff ff 58 call 20084b0 <_RBTree_Sibling> 2008754: b0 10 00 1d mov %i5, %i0 2008758: 10 bf ff ed b 200870c <_RBTree_Extract_validate_unprotected+0x19c> 200875c: ba 10 00 1c mov %i4, %i5 2008760: 81 c7 e0 08 ret 2008764: 81 e8 00 00 restore =============================================================================== 020089c8 <_RBTree_Find>: RBTree_Node *_RBTree_Find( RBTree_Control *the_rbtree, unsigned int the_value ) { 20089c8: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Node *return_node; return_node = NULL; _ISR_Disable( level ); 20089cc: 7f ff e7 f5 call 20029a0 20089d0: 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]; 20089d4: 10 80 00 09 b 20089f8 <_RBTree_Find+0x30> 20089d8: 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); 20089dc: 80 a6 40 01 cmp %i1, %g1 20089e0: 02 80 00 09 be 2008a04 <_RBTree_Find+0x3c> 20089e4: 80 a0 40 19 cmp %g1, %i1 RBTree_Direction dir = the_value > iter_node->value; 20089e8: 82 40 20 00 addx %g0, 0, %g1 iter_node = iter_node->child[dir]; 20089ec: 83 28 60 02 sll %g1, 2, %g1 20089f0: b0 06 00 01 add %i0, %g1, %i0 20089f4: 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) { 20089f8: 80 a6 20 00 cmp %i0, 0 20089fc: 32 bf ff f8 bne,a 20089dc <_RBTree_Find+0x14> <== ALWAYS TAKEN 2008a00: c2 06 20 0c ld [ %i0 + 0xc ], %g1 return_node = _RBTree_Find_unprotected( the_rbtree, the_value ); _ISR_Enable( level ); 2008a04: 7f ff e7 eb call 20029b0 2008a08: 01 00 00 00 nop return return_node; } 2008a0c: 81 c7 e0 08 ret 2008a10: 81 e8 00 00 restore =============================================================================== 02008978 <_RBTree_Find_header>: */ RBTree_Control *_RBTree_Find_header( RBTree_Node *the_node ) { 2008978: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; RBTree_Control *return_header; return_header = NULL; _ISR_Disable( level ); 200897c: 7f ff e8 09 call 20029a0 2008980: 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; 2008984: 80 a7 60 00 cmp %i5, 0 2008988: 02 80 00 0c be 20089b8 <_RBTree_Find_header+0x40> <== NEVER TAKEN 200898c: b0 10 20 00 clr %i0 if(!(the_node->parent)) return NULL; 2008990: c2 07 40 00 ld [ %i5 ], %g1 2008994: 80 a0 60 00 cmp %g1, 0 2008998: 32 80 00 03 bne,a 20089a4 <_RBTree_Find_header+0x2c> <== ALWAYS TAKEN 200899c: ba 10 00 01 mov %g1, %i5 20089a0: 30 80 00 06 b,a 20089b8 <_RBTree_Find_header+0x40> <== NOT EXECUTED while(the_node->parent) the_node = the_node->parent; 20089a4: c2 07 40 00 ld [ %i5 ], %g1 20089a8: 80 a0 60 00 cmp %g1, 0 20089ac: 32 bf ff fe bne,a 20089a4 <_RBTree_Find_header+0x2c> 20089b0: ba 10 00 01 mov %g1, %i5 20089b4: b0 10 00 1d mov %i5, %i0 return_header = _RBTree_Find_header_unprotected( the_node ); _ISR_Enable( level ); 20089b8: 7f ff e7 fe call 20029b0 20089bc: 01 00 00 00 nop return return_header; } 20089c0: 81 c7 e0 08 ret 20089c4: 81 e8 00 00 restore =============================================================================== 02008bb0 <_RBTree_Insert_unprotected>: */ RBTree_Node *_RBTree_Insert_unprotected( RBTree_Control *the_rbtree, RBTree_Node *the_node ) { 2008bb0: 9d e3 bf a0 save %sp, -96, %sp 2008bb4: 82 10 00 18 mov %i0, %g1 2008bb8: 90 10 00 19 mov %i1, %o0 if(!the_node) return (RBTree_Node*)-1; 2008bbc: 80 a6 60 00 cmp %i1, 0 2008bc0: 02 80 00 0d be 2008bf4 <_RBTree_Insert_unprotected+0x44> <== NEVER TAKEN 2008bc4: b0 10 3f ff mov -1, %i0 RBTree_Node *iter_node = the_rbtree->root; 2008bc8: f0 00 60 04 ld [ %g1 + 4 ], %i0 if (!iter_node) { /* special case: first node inserted */ 2008bcc: 80 a6 20 00 cmp %i0, 0 2008bd0: 32 80 00 1f bne,a 2008c4c <_RBTree_Insert_unprotected+0x9c> 2008bd4: c4 06 60 0c ld [ %i1 + 0xc ], %g2 the_node->color = RBT_BLACK; 2008bd8: c0 26 60 10 clr [ %i1 + 0x10 ] the_rbtree->root = the_node; 2008bdc: f2 20 60 04 st %i1, [ %g1 + 4 ] the_rbtree->first[0] = the_rbtree->first[1] = the_node; 2008be0: f2 20 60 0c st %i1, [ %g1 + 0xc ] 2008be4: f2 20 60 08 st %i1, [ %g1 + 8 ] the_node->parent = (RBTree_Node *) the_rbtree; 2008be8: c2 26 40 00 st %g1, [ %i1 ] the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; 2008bec: c0 26 60 08 clr [ %i1 + 8 ] 2008bf0: c0 26 60 04 clr [ %i1 + 4 ] 2008bf4: 81 c7 e0 08 ret 2008bf8: 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; 2008bfc: 86 40 20 00 addx %g0, 0, %g3 if (!iter_node->child[dir]) { 2008c00: 89 28 e0 02 sll %g3, 2, %g4 2008c04: 88 06 00 04 add %i0, %g4, %g4 2008c08: de 01 20 04 ld [ %g4 + 4 ], %o7 2008c0c: 80 a3 e0 00 cmp %o7, 0 2008c10: 32 80 00 0f bne,a 2008c4c <_RBTree_Insert_unprotected+0x9c> 2008c14: b0 10 00 0f mov %o7, %i0 the_node->child[RBT_LEFT] = the_node->child[RBT_RIGHT] = NULL; the_node->color = RBT_RED; 2008c18: 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; 2008c1c: c0 22 20 08 clr [ %o0 + 8 ] 2008c20: c0 22 20 04 clr [ %o0 + 4 ] the_node->color = RBT_RED; 2008c24: 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]; 2008c28: 84 00 e0 02 add %g3, 2, %g2 2008c2c: 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)) { 2008c30: 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; 2008c34: 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)) { 2008c38: 80 a6 00 03 cmp %i0, %g3 2008c3c: 12 80 00 0a bne 2008c64 <_RBTree_Insert_unprotected+0xb4> 2008c40: f0 22 00 00 st %i0, [ %o0 ] the_rbtree->first[dir] = the_node; 2008c44: 10 80 00 08 b 2008c64 <_RBTree_Insert_unprotected+0xb4> 2008c48: 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); 2008c4c: c6 06 20 0c ld [ %i0 + 0xc ], %g3 2008c50: 80 a0 80 03 cmp %g2, %g3 2008c54: 12 bf ff ea bne 2008bfc <_RBTree_Insert_unprotected+0x4c> 2008c58: 80 a0 c0 02 cmp %g3, %g2 2008c5c: 81 c7 e0 08 ret 2008c60: 81 e8 00 00 restore } } /* while(iter_node) */ /* verify red-black properties */ _RBTree_Validate_insert_unprotected(the_node); 2008c64: 7f ff ff 9a call 2008acc <_RBTree_Validate_insert_unprotected> 2008c68: b0 10 20 00 clr %i0 } return (RBTree_Node*)0; } 2008c6c: 81 c7 e0 08 ret 2008c70: 81 e8 00 00 restore =============================================================================== 020084f4 <_RBTree_Rotate>: RBTree_Node *the_node, RBTree_Direction dir ) { RBTree_Node *c; if (the_node == NULL) return; 20084f4: 80 a2 20 00 cmp %o0, 0 20084f8: 02 80 00 1c be 2008568 <_RBTree_Rotate+0x74> <== NEVER TAKEN 20084fc: 86 10 20 01 mov 1, %g3 if (the_node->child[(1-dir)] == NULL) return; 2008500: 86 20 c0 09 sub %g3, %o1, %g3 2008504: 87 28 e0 02 sll %g3, 2, %g3 2008508: 86 02 00 03 add %o0, %g3, %g3 200850c: c2 00 e0 04 ld [ %g3 + 4 ], %g1 2008510: 80 a0 60 00 cmp %g1, 0 2008514: 02 80 00 15 be 2008568 <_RBTree_Rotate+0x74> <== NEVER TAKEN 2008518: 93 2a 60 02 sll %o1, 2, %o1 c = the_node->child[(1-dir)]; the_node->child[(1-dir)] = c->child[dir]; 200851c: 84 00 40 09 add %g1, %o1, %g2 2008520: c8 00 a0 04 ld [ %g2 + 4 ], %g4 2008524: c8 20 e0 04 st %g4, [ %g3 + 4 ] if (c->child[dir]) 2008528: c4 00 a0 04 ld [ %g2 + 4 ], %g2 200852c: 80 a0 a0 00 cmp %g2, 0 2008530: 32 80 00 02 bne,a 2008538 <_RBTree_Rotate+0x44> 2008534: 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; 2008538: 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; 200853c: 92 00 40 09 add %g1, %o1, %o1 2008540: d0 22 60 04 st %o0, [ %o1 + 4 ] the_node->parent->child[the_node != the_node->parent->child[0]] = c; 2008544: c6 00 a0 04 ld [ %g2 + 4 ], %g3 c->parent = the_node->parent; 2008548: 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; 200854c: 86 1a 00 03 xor %o0, %g3, %g3 c->parent = the_node->parent; the_node->parent = c; 2008550: 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; 2008554: 80 a0 00 03 cmp %g0, %g3 2008558: 86 40 20 00 addx %g0, 0, %g3 200855c: 87 28 e0 02 sll %g3, 2, %g3 2008560: 86 00 80 03 add %g2, %g3, %g3 2008564: c2 20 e0 04 st %g1, [ %g3 + 4 ] 2008568: 81 c3 e0 08 retl =============================================================================== 020084b0 <_RBTree_Sibling>: */ RTEMS_INLINE_ROUTINE RBTree_Node *_RBTree_Sibling( RBTree_Node *the_node ) { if(!the_node) return NULL; 20084b0: 80 a2 20 00 cmp %o0, 0 20084b4: 02 80 00 0e be 20084ec <_RBTree_Sibling+0x3c> <== NEVER TAKEN 20084b8: 82 10 20 00 clr %g1 if(!(the_node->parent)) return NULL; 20084bc: c4 02 00 00 ld [ %o0 ], %g2 20084c0: 80 a0 a0 00 cmp %g2, 0 20084c4: 02 80 00 0a be 20084ec <_RBTree_Sibling+0x3c> <== NEVER TAKEN 20084c8: 01 00 00 00 nop if(!(the_node->parent->parent)) return NULL; 20084cc: c6 00 80 00 ld [ %g2 ], %g3 20084d0: 80 a0 e0 00 cmp %g3, 0 20084d4: 02 80 00 06 be 20084ec <_RBTree_Sibling+0x3c> 20084d8: 01 00 00 00 nop if(the_node == the_node->parent->child[RBT_LEFT]) 20084dc: c2 00 a0 04 ld [ %g2 + 4 ], %g1 20084e0: 80 a2 00 01 cmp %o0, %g1 20084e4: 22 80 00 02 be,a 20084ec <_RBTree_Sibling+0x3c> 20084e8: c2 00 a0 08 ld [ %g2 + 8 ], %g1 return the_node->parent->child[RBT_RIGHT]; else return the_node->parent->child[RBT_LEFT]; } 20084ec: 81 c3 e0 08 retl 20084f0: 90 10 00 01 mov %g1, %o0 =============================================================================== 02008acc <_RBTree_Validate_insert_unprotected>: * append operation. */ void _RBTree_Validate_insert_unprotected( RBTree_Node *the_node ) { 2008acc: 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))) { 2008ad0: 10 80 00 1f b 2008b4c <_RBTree_Validate_insert_unprotected+0x80> 2008ad4: 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; 2008ad8: 80 a0 60 00 cmp %g1, 0 2008adc: 02 80 00 27 be 2008b78 <_RBTree_Validate_insert_unprotected+0xac><== NEVER TAKEN 2008ae0: 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]) 2008ae4: 80 a2 00 01 cmp %o0, %g1 2008ae8: 22 80 00 02 be,a 2008af0 <_RBTree_Validate_insert_unprotected+0x24> 2008aec: 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); 2008af0: 80 a0 60 00 cmp %g1, 0 2008af4: 22 80 00 21 be,a 2008b78 <_RBTree_Validate_insert_unprotected+0xac> 2008af8: c2 07 60 04 ld [ %i5 + 4 ], %g1 2008afc: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 2008b00: 80 a0 a0 01 cmp %g2, 1 2008b04: 32 80 00 1d bne,a 2008b78 <_RBTree_Validate_insert_unprotected+0xac> 2008b08: 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; 2008b0c: c0 22 20 10 clr [ %o0 + 0x10 ] u->color = RBT_BLACK; 2008b10: c0 20 60 10 clr [ %g1 + 0x10 ] g->color = RBT_RED; 2008b14: c4 27 60 10 st %g2, [ %i5 + 0x10 ] 2008b18: 10 80 00 0d b 2008b4c <_RBTree_Validate_insert_unprotected+0x80> 2008b1c: 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); 2008b20: 7f ff ff cc call 2008a50 <_RBTree_Rotate> 2008b24: 92 10 00 1c mov %i4, %o1 the_node = the_node->child[pdir]; 2008b28: 83 2f 20 02 sll %i4, 2, %g1 2008b2c: b0 06 00 01 add %i0, %g1, %i0 2008b30: f0 06 20 04 ld [ %i0 + 4 ], %i0 } the_node->parent->color = RBT_BLACK; 2008b34: 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)); 2008b38: 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; 2008b3c: c0 20 60 10 clr [ %g1 + 0x10 ] g->color = RBT_RED; 2008b40: f6 27 60 10 st %i3, [ %i5 + 0x10 ] /* now rotate grandparent in the other branch direction (toward uncle) */ _RBTree_Rotate(g, (1-pdir)); 2008b44: 7f ff ff c3 call 2008a50 <_RBTree_Rotate> 2008b48: 92 26 c0 1c sub %i3, %i4, %o1 ISR_Level level; _ISR_Disable( level ); _RBTree_Insert_unprotected( tree, node ); _ISR_Enable( level ); } 2008b4c: 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; 2008b50: fa 02 00 00 ld [ %o0 ], %i5 2008b54: 80 a7 60 00 cmp %i5, 0 2008b58: 22 80 00 14 be,a 2008ba8 <_RBTree_Validate_insert_unprotected+0xdc> 2008b5c: 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); 2008b60: c2 02 20 10 ld [ %o0 + 0x10 ], %g1 2008b64: 80 a0 60 01 cmp %g1, 1 2008b68: 12 80 00 10 bne 2008ba8 <_RBTree_Validate_insert_unprotected+0xdc> 2008b6c: 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; 2008b70: 10 bf ff da b 2008ad8 <_RBTree_Validate_insert_unprotected+0xc> 2008b74: 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]; 2008b78: 82 1a 00 01 xor %o0, %g1, %g1 2008b7c: 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]; 2008b80: c2 02 20 04 ld [ %o0 + 4 ], %g1 RBTree_Direction pdir = the_node->parent != g->child[0]; 2008b84: 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]; 2008b88: 82 1e 00 01 xor %i0, %g1, %g1 2008b8c: 80 a0 00 01 cmp %g0, %g1 2008b90: 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) { 2008b94: 80 a0 40 1c cmp %g1, %i4 2008b98: 12 bf ff e2 bne 2008b20 <_RBTree_Validate_insert_unprotected+0x54> 2008b9c: 01 00 00 00 nop _RBTree_Rotate(the_node->parent, pdir); the_node = the_node->child[pdir]; } the_node->parent->color = RBT_BLACK; 2008ba0: 10 bf ff e6 b 2008b38 <_RBTree_Validate_insert_unprotected+0x6c> 2008ba4: c2 06 00 00 ld [ %i0 ], %g1 2008ba8: 81 c7 e0 08 ret 2008bac: 81 e8 00 00 restore =============================================================================== 02007624 <_Rate_monotonic_Timeout>: void _Rate_monotonic_Timeout( Objects_Id id, void *ignored ) { 2007624: 9d e3 bf 98 save %sp, -104, %sp 2007628: 11 00 80 79 sethi %hi(0x201e400), %o0 200762c: 92 10 00 18 mov %i0, %o1 2007630: 90 12 22 44 or %o0, 0x244, %o0 2007634: 40 00 07 db call 20095a0 <_Objects_Get> 2007638: 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 ) { 200763c: c2 07 bf fc ld [ %fp + -4 ], %g1 2007640: 80 a0 60 00 cmp %g1, 0 2007644: 12 80 00 25 bne 20076d8 <_Rate_monotonic_Timeout+0xb4> <== NEVER TAKEN 2007648: ba 10 00 08 mov %o0, %i5 case OBJECTS_LOCAL: the_thread = the_period->owner; 200764c: d0 02 20 40 ld [ %o0 + 0x40 ], %o0 if ( _States_Is_waiting_for_period( the_thread->current_state ) && 2007650: 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); 2007654: c4 02 20 10 ld [ %o0 + 0x10 ], %g2 2007658: 80 88 80 01 btst %g2, %g1 200765c: 22 80 00 0b be,a 2007688 <_Rate_monotonic_Timeout+0x64> 2007660: c2 07 60 38 ld [ %i5 + 0x38 ], %g1 2007664: c4 02 20 20 ld [ %o0 + 0x20 ], %g2 2007668: c2 07 60 08 ld [ %i5 + 8 ], %g1 200766c: 80 a0 80 01 cmp %g2, %g1 2007670: 32 80 00 06 bne,a 2007688 <_Rate_monotonic_Timeout+0x64> 2007674: 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 ); 2007678: 13 04 00 ff sethi %hi(0x1003fc00), %o1 200767c: 40 00 0a 77 call 200a058 <_Thread_Clear_state> 2007680: 92 12 63 f8 or %o1, 0x3f8, %o1 ! 1003fff8 2007684: 30 80 00 06 b,a 200769c <_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 ) { 2007688: 80 a0 60 01 cmp %g1, 1 200768c: 12 80 00 0d bne 20076c0 <_Rate_monotonic_Timeout+0x9c> 2007690: 82 10 20 04 mov 4, %g1 the_period->state = RATE_MONOTONIC_EXPIRED_WHILE_BLOCKING; 2007694: 82 10 20 03 mov 3, %g1 2007698: c2 27 60 38 st %g1, [ %i5 + 0x38 ] _Rate_monotonic_Initiate_statistics( the_period ); 200769c: 7f ff fe 70 call 200705c <_Rate_monotonic_Initiate_statistics> 20076a0: 90 10 00 1d mov %i5, %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20076a4: c2 07 60 3c ld [ %i5 + 0x3c ], %g1 _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20076a8: 11 00 80 7a sethi %hi(0x201e800), %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 20076ac: c2 27 60 1c st %g1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 20076b0: 90 12 20 74 or %o0, 0x74, %o0 20076b4: 40 00 0f 49 call 200b3d8 <_Watchdog_Insert> 20076b8: 92 07 60 10 add %i5, 0x10, %o1 20076bc: 30 80 00 02 b,a 20076c4 <_Rate_monotonic_Timeout+0xa0> _Watchdog_Insert_ticks( &the_period->Timer, the_period->next_length ); } else the_period->state = RATE_MONOTONIC_EXPIRED; 20076c0: 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--; 20076c4: 03 00 80 79 sethi %hi(0x201e400), %g1 20076c8: c4 00 63 b0 ld [ %g1 + 0x3b0 ], %g2 ! 201e7b0 <_Thread_Dispatch_disable_level> 20076cc: 84 00 bf ff add %g2, -1, %g2 20076d0: c4 20 63 b0 st %g2, [ %g1 + 0x3b0 ] return _Thread_Dispatch_disable_level; 20076d4: c2 00 63 b0 ld [ %g1 + 0x3b0 ], %g1 20076d8: 81 c7 e0 08 ret 20076dc: 81 e8 00 00 restore =============================================================================== 0200709c <_TOD_Validate>: */ bool _TOD_Validate( const rtems_time_of_day *the_tod ) { 200709c: 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(); 20070a0: 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; 20070a4: 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) || 20070a8: 80 a6 20 00 cmp %i0, 0 20070ac: 02 80 00 2b be 2007158 <_TOD_Validate+0xbc> <== NEVER TAKEN 20070b0: d2 00 63 08 ld [ %g1 + 0x308 ], %o1 ) { uint32_t days_in_month; uint32_t ticks_per_second; ticks_per_second = TOD_MICROSECONDS_PER_SECOND / 20070b4: 11 00 03 d0 sethi %hi(0xf4000), %o0 20070b8: 40 00 49 e8 call 2019858 <.udiv> 20070bc: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 rtems_configuration_get_microseconds_per_tick(); if ((!the_tod) || 20070c0: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 20070c4: 80 a0 40 08 cmp %g1, %o0 20070c8: 3a 80 00 25 bcc,a 200715c <_TOD_Validate+0xc0> 20070cc: b0 0f 60 01 and %i5, 1, %i0 (the_tod->ticks >= ticks_per_second) || 20070d0: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 20070d4: 80 a0 60 3b cmp %g1, 0x3b 20070d8: 38 80 00 21 bgu,a 200715c <_TOD_Validate+0xc0> 20070dc: b0 0f 60 01 and %i5, 1, %i0 (the_tod->second >= TOD_SECONDS_PER_MINUTE) || 20070e0: c2 06 20 10 ld [ %i0 + 0x10 ], %g1 20070e4: 80 a0 60 3b cmp %g1, 0x3b 20070e8: 38 80 00 1d bgu,a 200715c <_TOD_Validate+0xc0> 20070ec: b0 0f 60 01 and %i5, 1, %i0 (the_tod->minute >= TOD_MINUTES_PER_HOUR) || 20070f0: c2 06 20 0c ld [ %i0 + 0xc ], %g1 20070f4: 80 a0 60 17 cmp %g1, 0x17 20070f8: 38 80 00 19 bgu,a 200715c <_TOD_Validate+0xc0> 20070fc: b0 0f 60 01 and %i5, 1, %i0 (the_tod->hour >= TOD_HOURS_PER_DAY) || (the_tod->month == 0) || 2007100: 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) || 2007104: 80 a0 60 00 cmp %g1, 0 2007108: 02 80 00 14 be 2007158 <_TOD_Validate+0xbc> <== NEVER TAKEN 200710c: 80 a0 60 0c cmp %g1, 0xc (the_tod->month == 0) || 2007110: 38 80 00 13 bgu,a 200715c <_TOD_Validate+0xc0> 2007114: b0 0f 60 01 and %i5, 1, %i0 (the_tod->month > TOD_MONTHS_PER_YEAR) || (the_tod->year < TOD_BASE_YEAR) || 2007118: 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) || 200711c: 80 a0 e7 c3 cmp %g3, 0x7c3 2007120: 28 80 00 0f bleu,a 200715c <_TOD_Validate+0xc0> 2007124: b0 0f 60 01 and %i5, 1, %i0 (the_tod->year < TOD_BASE_YEAR) || (the_tod->day == 0) ) 2007128: 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) || 200712c: 80 a0 a0 00 cmp %g2, 0 2007130: 02 80 00 0a be 2007158 <_TOD_Validate+0xbc> <== NEVER TAKEN 2007134: 80 88 e0 03 btst 3, %g3 2007138: 07 00 80 73 sethi %hi(0x201cc00), %g3 (the_tod->day == 0) ) return false; if ( (the_tod->year % 4) == 0 ) 200713c: 12 80 00 03 bne 2007148 <_TOD_Validate+0xac> 2007140: 86 10 e2 60 or %g3, 0x260, %g3 ! 201ce60 <_TOD_Days_per_month> days_in_month = _TOD_Days_per_month[ 1 ][ the_tod->month ]; 2007144: 82 00 60 0d add %g1, 0xd, %g1 else days_in_month = _TOD_Days_per_month[ 0 ][ the_tod->month ]; 2007148: 83 28 60 02 sll %g1, 2, %g1 200714c: 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( 2007150: 80 a0 40 02 cmp %g1, %g2 2007154: ba 60 3f ff subx %g0, -1, %i5 if ( the_tod->day > days_in_month ) return false; return true; } 2007158: b0 0f 60 01 and %i5, 1, %i0 200715c: 81 c7 e0 08 ret 2007160: 81 e8 00 00 restore =============================================================================== 020086ec <_Thread_Change_priority>: void _Thread_Change_priority( Thread_Control *the_thread, Priority_Control new_priority, bool prepend_it ) { 20086ec: 9d e3 bf a0 save %sp, -96, %sp States_Control state, original_state; /* * Save original state */ original_state = the_thread->current_state; 20086f0: 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 ); 20086f4: 40 00 03 60 call 2009474 <_Thread_Set_transient> 20086f8: 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 ) 20086fc: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2008700: 80 a0 40 19 cmp %g1, %i1 2008704: 02 80 00 05 be 2008718 <_Thread_Change_priority+0x2c> 2008708: ba 10 00 18 mov %i0, %i5 _Thread_Set_priority( the_thread, new_priority ); 200870c: 90 10 00 18 mov %i0, %o0 2008710: 40 00 03 40 call 2009410 <_Thread_Set_priority> 2008714: 92 10 00 19 mov %i1, %o1 _ISR_Disable( level ); 2008718: 7f ff e6 7d call 200210c 200871c: 01 00 00 00 nop 2008720: 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; 2008724: f2 07 60 10 ld [ %i5 + 0x10 ], %i1 if ( state != STATES_TRANSIENT ) { 2008728: 80 a6 60 04 cmp %i1, 4 200872c: 02 80 00 10 be 200876c <_Thread_Change_priority+0x80> 2008730: 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 ) ) 2008734: 80 a7 20 00 cmp %i4, 0 2008738: 12 80 00 03 bne 2008744 <_Thread_Change_priority+0x58> <== NEVER TAKEN 200873c: 82 0e 7f fb and %i1, -5, %g1 the_thread->current_state = _States_Clear( STATES_TRANSIENT, state ); 2008740: c2 27 60 10 st %g1, [ %i5 + 0x10 ] _ISR_Enable( level ); 2008744: 7f ff e6 76 call 200211c 2008748: 90 10 00 1b mov %i3, %o0 if ( _States_Is_waiting_on_thread_queue( state ) ) { 200874c: 03 00 00 ef sethi %hi(0x3bc00), %g1 2008750: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 2008754: 80 8e 40 01 btst %i1, %g1 2008758: 02 80 00 29 be 20087fc <_Thread_Change_priority+0x110> 200875c: 01 00 00 00 nop _Thread_queue_Requeue( the_thread->Wait.queue, the_thread ); 2008760: f0 07 60 44 ld [ %i5 + 0x44 ], %i0 2008764: 40 00 02 fd call 2009358 <_Thread_queue_Requeue> 2008768: 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 ) ) { 200876c: 80 a7 20 00 cmp %i4, 0 2008770: 12 80 00 0b bne 200879c <_Thread_Change_priority+0xb0> <== NEVER TAKEN 2008774: 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 ); 2008778: c0 27 60 10 clr [ %i5 + 0x10 ] if ( prepend_it ) 200877c: 80 a6 a0 00 cmp %i2, 0 2008780: 02 80 00 04 be 2008790 <_Thread_Change_priority+0xa4> 2008784: 82 10 60 84 or %g1, 0x84, %g1 */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue_first( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue_first( the_thread ); 2008788: 10 80 00 03 b 2008794 <_Thread_Change_priority+0xa8> 200878c: c2 00 60 28 ld [ %g1 + 0x28 ], %g1 */ RTEMS_INLINE_ROUTINE void _Scheduler_Enqueue( Thread_Control *the_thread ) { _Scheduler.Operations.enqueue( the_thread ); 2008790: c2 00 60 24 ld [ %g1 + 0x24 ], %g1 2008794: 9f c0 40 00 call %g1 2008798: 90 10 00 1d mov %i5, %o0 _Scheduler_Enqueue_first( the_thread ); else _Scheduler_Enqueue( the_thread ); } _ISR_Flash( level ); 200879c: 7f ff e6 60 call 200211c 20087a0: 90 10 00 1b mov %i3, %o0 20087a4: 7f ff e6 5a call 200210c 20087a8: 01 00 00 00 nop 20087ac: 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(); 20087b0: 03 00 80 6f sethi %hi(0x201bc00), %g1 20087b4: c2 00 60 8c ld [ %g1 + 0x8c ], %g1 ! 201bc8c <_Scheduler+0x8> 20087b8: 9f c0 40 00 call %g1 20087bc: 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 ); 20087c0: 03 00 80 73 sethi %hi(0x201cc00), %g1 20087c4: 82 10 62 38 or %g1, 0x238, %g1 ! 201ce38 <_Per_CPU_Information> 20087c8: 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() && 20087cc: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 20087d0: 80 a0 80 03 cmp %g2, %g3 20087d4: 02 80 00 08 be 20087f4 <_Thread_Change_priority+0x108> 20087d8: 01 00 00 00 nop 20087dc: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 20087e0: 80 a0 a0 00 cmp %g2, 0 20087e4: 02 80 00 04 be 20087f4 <_Thread_Change_priority+0x108> 20087e8: 01 00 00 00 nop _Thread_Executing->is_preemptible ) _Thread_Dispatch_necessary = true; 20087ec: 84 10 20 01 mov 1, %g2 ! 1 20087f0: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] _ISR_Enable( level ); 20087f4: 7f ff e6 4a call 200211c 20087f8: 81 e8 00 00 restore 20087fc: 81 c7 e0 08 ret 2008800: 81 e8 00 00 restore =============================================================================== 020089f0 <_Thread_Delay_ended>: void _Thread_Delay_ended( Objects_Id id, void *ignored __attribute__((unused)) ) { 20089f0: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 20089f4: 90 10 00 18 mov %i0, %o0 20089f8: 40 00 00 6c call 2008ba8 <_Thread_Get> 20089fc: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2008a00: c2 07 bf fc ld [ %fp + -4 ], %g1 2008a04: 80 a0 60 00 cmp %g1, 0 2008a08: 12 80 00 09 bne 2008a2c <_Thread_Delay_ended+0x3c> <== NEVER TAKEN 2008a0c: 13 04 00 00 sethi %hi(0x10000000), %o1 #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_Clear_state( 2008a10: 7f ff ff 7d call 2008804 <_Thread_Clear_state> 2008a14: 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--; 2008a18: 03 00 80 72 sethi %hi(0x201c800), %g1 2008a1c: c4 00 61 00 ld [ %g1 + 0x100 ], %g2 ! 201c900 <_Thread_Dispatch_disable_level> 2008a20: 84 00 bf ff add %g2, -1, %g2 2008a24: c4 20 61 00 st %g2, [ %g1 + 0x100 ] return _Thread_Dispatch_disable_level; 2008a28: c2 00 61 00 ld [ %g1 + 0x100 ], %g1 2008a2c: 81 c7 e0 08 ret 2008a30: 81 e8 00 00 restore =============================================================================== 02008a34 <_Thread_Dispatch>: * dispatch thread * no dispatch thread */ void _Thread_Dispatch( void ) { 2008a34: 9d e3 bf 90 save %sp, -112, %sp Thread_Control *executing; Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; 2008a38: 33 00 80 73 sethi %hi(0x201cc00), %i1 2008a3c: 82 16 62 38 or %i1, 0x238, %g1 ! 201ce38 <_Per_CPU_Information> _ISR_Disable( level ); 2008a40: 7f ff e5 b3 call 200210c 2008a44: fa 00 60 0c ld [ %g1 + 0xc ], %i5 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 2008a48: 37 00 80 72 sethi %hi(0x201c800), %i3 * 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; 2008a4c: 23 00 80 72 sethi %hi(0x201c800), %l1 #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; 2008a50: 21 00 80 72 sethi %hi(0x201c800), %l0 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); _Timestamp_Subtract( 2008a54: b6 16 e1 b0 or %i3, 0x1b0, %i3 #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 2008a58: 31 00 80 72 sethi %hi(0x201c800), %i0 Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 2008a5c: 10 80 00 3a b 2008b44 <_Thread_Dispatch+0x110> 2008a60: 35 00 80 72 sethi %hi(0x201c800), %i2 2008a64: 84 10 20 01 mov 1, %g2 2008a68: c4 24 61 00 st %g2, [ %l1 + 0x100 ] heir = _Thread_Heir; _Thread_Dispatch_set_disable_level( 1 ); _Thread_Dispatch_necessary = false; 2008a6c: 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 ) 2008a70: 80 a7 00 1d cmp %i4, %i5 2008a74: 02 80 00 39 be 2008b58 <_Thread_Dispatch+0x124> 2008a78: 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 ) 2008a7c: c2 07 20 7c ld [ %i4 + 0x7c ], %g1 2008a80: 80 a0 60 01 cmp %g1, 1 2008a84: 12 80 00 03 bne 2008a90 <_Thread_Dispatch+0x5c> 2008a88: c2 04 20 64 ld [ %l0 + 0x64 ], %g1 heir->cpu_time_budget = _Thread_Ticks_per_timeslice; 2008a8c: c2 27 20 78 st %g1, [ %i4 + 0x78 ] _ISR_Enable( level ); 2008a90: 7f ff e5 a3 call 200211c 2008a94: 01 00 00 00 nop #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ { Timestamp_Control uptime, ran; _TOD_Get_uptime( &uptime ); 2008a98: 40 00 0e f1 call 200c65c <_TOD_Get_uptime> 2008a9c: 90 07 bf f0 add %fp, -16, %o0 _Timestamp_Subtract( 2008aa0: 90 10 00 1b mov %i3, %o0 2008aa4: 92 07 bf f0 add %fp, -16, %o1 2008aa8: 40 00 03 18 call 2009708 <_Timespec_Subtract> 2008aac: 94 07 bf f8 add %fp, -8, %o2 &_Thread_Time_of_last_context_switch, &uptime, &ran ); _Timestamp_Add_to( &executing->cpu_time_used, &ran ); 2008ab0: 90 07 60 84 add %i5, 0x84, %o0 2008ab4: 40 00 02 fc call 20096a4 <_Timespec_Add_to> 2008ab8: 92 07 bf f8 add %fp, -8, %o1 _Thread_Time_of_last_context_switch = uptime; 2008abc: c2 07 bf f0 ld [ %fp + -16 ], %g1 2008ac0: c2 26 c0 00 st %g1, [ %i3 ] 2008ac4: c2 07 bf f4 ld [ %fp + -12 ], %g1 2008ac8: c2 26 e0 04 st %g1, [ %i3 + 4 ] #endif /* * Switch libc's task specific data. */ if ( _Thread_libc_reent ) { 2008acc: c2 06 21 88 ld [ %i0 + 0x188 ], %g1 2008ad0: 80 a0 60 00 cmp %g1, 0 2008ad4: 02 80 00 06 be 2008aec <_Thread_Dispatch+0xb8> <== NEVER TAKEN 2008ad8: 90 10 00 1d mov %i5, %o0 executing->libc_reent = *_Thread_libc_reent; 2008adc: c4 00 40 00 ld [ %g1 ], %g2 2008ae0: c4 27 61 54 st %g2, [ %i5 + 0x154 ] *_Thread_libc_reent = heir->libc_reent; 2008ae4: c4 07 21 54 ld [ %i4 + 0x154 ], %g2 2008ae8: c4 20 40 00 st %g2, [ %g1 ] } _User_extensions_Thread_switch( executing, heir ); 2008aec: 40 00 03 b5 call 20099c0 <_User_extensions_Thread_switch> 2008af0: 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 ); 2008af4: 90 07 60 c8 add %i5, 0xc8, %o0 2008af8: 40 00 04 db call 2009e64 <_CPU_Context_switch> 2008afc: 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) && 2008b00: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 2008b04: 80 a0 60 00 cmp %g1, 0 2008b08: 02 80 00 0c be 2008b38 <_Thread_Dispatch+0x104> 2008b0c: d0 06 a1 84 ld [ %i2 + 0x184 ], %o0 2008b10: 80 a7 40 08 cmp %i5, %o0 2008b14: 02 80 00 09 be 2008b38 <_Thread_Dispatch+0x104> 2008b18: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 2008b1c: 02 80 00 04 be 2008b2c <_Thread_Dispatch+0xf8> 2008b20: 01 00 00 00 nop _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 2008b24: 40 00 04 96 call 2009d7c <_CPU_Context_save_fp> 2008b28: 90 02 21 50 add %o0, 0x150, %o0 _Context_Restore_fp( &executing->fp_context ); 2008b2c: 40 00 04 b1 call 2009df0 <_CPU_Context_restore_fp> 2008b30: 90 07 61 50 add %i5, 0x150, %o0 _Thread_Allocated_fp = executing; 2008b34: fa 26 a1 84 st %i5, [ %i2 + 0x184 ] if ( executing->fp_context != NULL ) _Context_Restore_fp( &executing->fp_context ); #endif #endif executing = _Thread_Executing; 2008b38: 82 16 62 38 or %i1, 0x238, %g1 _ISR_Disable( level ); 2008b3c: 7f ff e5 74 call 200210c 2008b40: fa 00 60 0c ld [ %g1 + 0xc ], %i5 Thread_Control *heir; ISR_Level level; executing = _Thread_Executing; _ISR_Disable( level ); while ( _Thread_Dispatch_necessary == true ) { 2008b44: 82 16 62 38 or %i1, 0x238, %g1 2008b48: c4 08 60 18 ldub [ %g1 + 0x18 ], %g2 2008b4c: 80 a0 a0 00 cmp %g2, 0 2008b50: 32 bf ff c5 bne,a 2008a64 <_Thread_Dispatch+0x30> 2008b54: f8 00 60 10 ld [ %g1 + 0x10 ], %i4 2008b58: 03 00 80 72 sethi %hi(0x201c800), %g1 2008b5c: c0 20 61 00 clr [ %g1 + 0x100 ] ! 201c900 <_Thread_Dispatch_disable_level> } post_switch: _Thread_Dispatch_set_disable_level( 0 ); _ISR_Enable( level ); 2008b60: 7f ff e5 6f call 200211c 2008b64: 01 00 00 00 nop _API_extensions_Run_postswitch(); 2008b68: 7f ff f8 6f call 2006d24 <_API_extensions_Run_postswitch> 2008b6c: 01 00 00 00 nop } 2008b70: 81 c7 e0 08 ret 2008b74: 81 e8 00 00 restore =============================================================================== 0200e708 <_Thread_Handler>: * * Output parameters: NONE */ void _Thread_Handler( void ) { 200e708: 9d e3 bf a0 save %sp, -96, %sp #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) static char doneConstructors; char doneCons; #endif executing = _Thread_Executing; 200e70c: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e710: fa 00 62 44 ld [ %g1 + 0x244 ], %i5 ! 201ce44 <_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(); 200e714: 3f 00 80 39 sethi %hi(0x200e400), %i7 200e718: be 17 e3 08 or %i7, 0x308, %i7 ! 200e708 <_Thread_Handler> /* * have to put level into a register for those cpu's that use * inline asm here */ level = executing->Start.isr_level; 200e71c: d0 07 60 ac ld [ %i5 + 0xac ], %o0 _ISR_Set_level(level); 200e720: 7f ff ce 7f call 200211c 200e724: 91 2a 20 08 sll %o0, 8, %o0 #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200e728: 03 00 80 71 sethi %hi(0x201c400), %g1 doneConstructors = 1; 200e72c: 84 10 20 01 mov 1, %g2 level = executing->Start.isr_level; _ISR_Set_level(level); #if defined(EXECUTE_GLOBAL_CONSTRUCTORS) doneCons = doneConstructors; 200e730: f8 08 61 bc ldub [ %g1 + 0x1bc ], %i4 doneConstructors = 1; 200e734: c4 28 61 bc stb %g2, [ %g1 + 0x1bc ] #endif #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) #if ( CPU_USE_DEFERRED_FP_SWITCH == TRUE ) if ( (executing->fp_context != NULL) && 200e738: c2 07 61 50 ld [ %i5 + 0x150 ], %g1 200e73c: 80 a0 60 00 cmp %g1, 0 200e740: 02 80 00 0c be 200e770 <_Thread_Handler+0x68> 200e744: 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 ); 200e748: d0 00 61 84 ld [ %g1 + 0x184 ], %o0 ! 201c984 <_Thread_Allocated_fp> 200e74c: 80 a7 40 08 cmp %i5, %o0 200e750: 02 80 00 08 be 200e770 <_Thread_Handler+0x68> 200e754: 80 a2 20 00 cmp %o0, 0 !_Thread_Is_allocated_fp( executing ) ) { if ( _Thread_Allocated_fp != NULL ) 200e758: 22 80 00 06 be,a 200e770 <_Thread_Handler+0x68> 200e75c: fa 20 61 84 st %i5, [ %g1 + 0x184 ] _Context_Save_fp( &_Thread_Allocated_fp->fp_context ); 200e760: 7f ff ed 87 call 2009d7c <_CPU_Context_save_fp> 200e764: 90 02 21 50 add %o0, 0x150, %o0 _Thread_Allocated_fp = executing; 200e768: 03 00 80 72 sethi %hi(0x201c800), %g1 200e76c: fa 20 61 84 st %i5, [ %g1 + 0x184 ] ! 201c984 <_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 ); 200e770: 7f ff ec 25 call 2009804 <_User_extensions_Thread_begin> 200e774: 90 10 00 1d mov %i5, %o0 /* * At this point, the dispatch disable level BETTER be 1. */ _Thread_Enable_dispatch(); 200e778: 7f ff e9 00 call 2008b78 <_Thread_Enable_dispatch> 200e77c: 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) */ { 200e780: 80 a7 20 00 cmp %i4, 0 200e784: 32 80 00 05 bne,a 200e798 <_Thread_Handler+0x90> 200e788: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 INIT_NAME (); 200e78c: 40 00 34 f5 call 201bb60 <_init> 200e790: 01 00 00 00 nop } #endif if ( executing->Start.prototype == THREAD_START_NUMERIC ) { 200e794: c2 07 60 94 ld [ %i5 + 0x94 ], %g1 200e798: 80 a0 60 00 cmp %g1, 0 200e79c: 12 80 00 05 bne 200e7b0 <_Thread_Handler+0xa8> 200e7a0: 80 a0 60 01 cmp %g1, 1 executing->Wait.return_argument = (*(Thread_Entry_numeric) executing->Start.entry_point)( 200e7a4: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 200e7a8: 10 80 00 06 b 200e7c0 <_Thread_Handler+0xb8> 200e7ac: 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 ) { 200e7b0: 12 80 00 07 bne 200e7cc <_Thread_Handler+0xc4> <== NEVER TAKEN 200e7b4: 01 00 00 00 nop executing->Wait.return_argument = (*(Thread_Entry_pointer) executing->Start.entry_point)( 200e7b8: c2 07 60 90 ld [ %i5 + 0x90 ], %g1 200e7bc: d0 07 60 98 ld [ %i5 + 0x98 ], %o0 200e7c0: 9f c0 40 00 call %g1 200e7c4: 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 = 200e7c8: 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 ); 200e7cc: 7f ff ec 1f call 2009848 <_User_extensions_Thread_exitted> 200e7d0: 90 10 00 1d mov %i5, %o0 _Internal_error_Occurred( 200e7d4: 90 10 20 00 clr %o0 200e7d8: 92 10 20 01 mov 1, %o1 200e7dc: 7f ff e3 f5 call 20077b0 <_Internal_error_Occurred> 200e7e0: 94 10 20 05 mov 5, %o2 =============================================================================== 02008c58 <_Thread_Initialize>: Thread_CPU_budget_algorithms budget_algorithm, Thread_CPU_budget_algorithm_callout budget_callout, uint32_t isr_level, Objects_Name name ) { 2008c58: 9d e3 bf a0 save %sp, -96, %sp 2008c5c: 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; 2008c60: c0 26 61 58 clr [ %i1 + 0x158 ] 2008c64: c0 26 61 5c clr [ %i1 + 0x15c ] extensions_area = NULL; the_thread->libc_reent = NULL; 2008c68: 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 ) { 2008c6c: e0 07 a0 60 ld [ %fp + 0x60 ], %l0 2008c70: 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 ) { 2008c74: 80 a6 a0 00 cmp %i2, 0 2008c78: 12 80 00 0d bne 2008cac <_Thread_Initialize+0x54> 2008c7c: e4 0f a0 5f ldub [ %fp + 0x5f ], %l2 actual_stack_size = _Thread_Stack_Allocate( the_thread, stack_size ); 2008c80: 90 10 00 19 mov %i1, %o0 2008c84: 40 00 02 0b call 20094b0 <_Thread_Stack_Allocate> 2008c88: 92 10 00 1b mov %i3, %o1 if ( !actual_stack_size || actual_stack_size < stack_size ) 2008c8c: 80 a2 00 1b cmp %o0, %i3 2008c90: 0a 80 00 6a bcs 2008e38 <_Thread_Initialize+0x1e0> 2008c94: 80 a2 20 00 cmp %o0, 0 2008c98: 02 80 00 68 be 2008e38 <_Thread_Initialize+0x1e0> <== NEVER TAKEN 2008c9c: 82 10 20 01 mov 1, %g1 return false; /* stack allocation failed */ stack = the_thread->Start.stack; 2008ca0: f4 06 60 c4 ld [ %i1 + 0xc4 ], %i2 the_thread->Start.core_allocated_stack = true; 2008ca4: 10 80 00 04 b 2008cb4 <_Thread_Initialize+0x5c> 2008ca8: c2 2e 60 b4 stb %g1, [ %i1 + 0xb4 ] } else { stack = stack_area; actual_stack_size = stack_size; the_thread->Start.core_allocated_stack = false; 2008cac: c0 2e 60 b4 clrb [ %i1 + 0xb4 ] 2008cb0: 90 10 00 1b mov %i3, %o0 Stack_Control *the_stack, void *starting_address, size_t size ) { the_stack->area = starting_address; 2008cb4: f4 26 60 bc st %i2, [ %i1 + 0xbc ] the_stack->size = size; 2008cb8: 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 ) { 2008cbc: 80 a7 20 00 cmp %i4, 0 2008cc0: 02 80 00 07 be 2008cdc <_Thread_Initialize+0x84> 2008cc4: b6 10 20 00 clr %i3 fp_area = _Workspace_Allocate( CONTEXT_FP_SIZE ); 2008cc8: 40 00 04 11 call 2009d0c <_Workspace_Allocate> 2008ccc: 90 10 20 88 mov 0x88, %o0 if ( !fp_area ) 2008cd0: b6 92 20 00 orcc %o0, 0, %i3 2008cd4: 02 80 00 4a be 2008dfc <_Thread_Initialize+0x1a4> 2008cd8: b8 10 20 00 clr %i4 #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2008cdc: 03 00 80 72 sethi %hi(0x201c800), %g1 2008ce0: d0 00 61 94 ld [ %g1 + 0x194 ], %o0 ! 201c994 <_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; 2008ce4: f6 26 61 50 st %i3, [ %i1 + 0x150 ] the_thread->Start.fp_context = fp_area; 2008ce8: f6 26 60 c0 st %i3, [ %i1 + 0xc0 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2008cec: c0 26 60 50 clr [ %i1 + 0x50 ] the_watchdog->routine = routine; 2008cf0: c0 26 60 64 clr [ %i1 + 0x64 ] the_watchdog->id = id; 2008cf4: c0 26 60 68 clr [ %i1 + 0x68 ] the_watchdog->user_data = user_data; 2008cf8: c0 26 60 6c clr [ %i1 + 0x6c ] #endif /* * Allocate the extensions area for this thread */ if ( _Thread_Maximum_extensions ) { 2008cfc: 80 a2 20 00 cmp %o0, 0 2008d00: 02 80 00 08 be 2008d20 <_Thread_Initialize+0xc8> 2008d04: b8 10 20 00 clr %i4 extensions_area = _Workspace_Allocate( 2008d08: 90 02 20 01 inc %o0 2008d0c: 40 00 04 00 call 2009d0c <_Workspace_Allocate> 2008d10: 91 2a 20 02 sll %o0, 2, %o0 (_Thread_Maximum_extensions + 1) * sizeof( void * ) ); if ( !extensions_area ) 2008d14: b8 92 20 00 orcc %o0, 0, %i4 2008d18: 02 80 00 3a be 2008e00 <_Thread_Initialize+0x1a8> 2008d1c: 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 ) { 2008d20: 80 a7 20 00 cmp %i4, 0 2008d24: 02 80 00 0c be 2008d54 <_Thread_Initialize+0xfc> 2008d28: f8 26 61 60 st %i4, [ %i1 + 0x160 ] for ( i = 0; i <= _Thread_Maximum_extensions ; i++ ) 2008d2c: 03 00 80 72 sethi %hi(0x201c800), %g1 2008d30: c4 00 61 94 ld [ %g1 + 0x194 ], %g2 ! 201c994 <_Thread_Maximum_extensions> 2008d34: 10 80 00 05 b 2008d48 <_Thread_Initialize+0xf0> 2008d38: 82 10 20 00 clr %g1 the_thread->extensions[i] = NULL; 2008d3c: 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++ ) 2008d40: 82 00 60 01 inc %g1 the_thread->extensions[i] = NULL; 2008d44: 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++ ) 2008d48: 80 a0 40 02 cmp %g1, %g2 2008d4c: 28 bf ff fc bleu,a 2008d3c <_Thread_Initialize+0xe4> 2008d50: 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; 2008d54: c2 07 a0 64 ld [ %fp + 0x64 ], %g1 /* * General initialization */ the_thread->Start.is_preemptible = is_preemptible; 2008d58: e4 2e 60 a0 stb %l2, [ %i1 + 0xa0 ] the_thread->Start.budget_algorithm = budget_algorithm; 2008d5c: e0 26 60 a4 st %l0, [ %i1 + 0xa4 ] the_thread->Start.budget_callout = budget_callout; switch ( budget_algorithm ) { 2008d60: 80 a4 20 02 cmp %l0, 2 2008d64: 12 80 00 05 bne 2008d78 <_Thread_Initialize+0x120> 2008d68: 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; 2008d6c: 03 00 80 72 sethi %hi(0x201c800), %g1 2008d70: c2 00 60 64 ld [ %g1 + 0x64 ], %g1 ! 201c864 <_Thread_Ticks_per_timeslice> 2008d74: c2 26 60 78 st %g1, [ %i1 + 0x78 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2008d78: c2 07 a0 68 ld [ %fp + 0x68 ], %g1 the_thread->current_state = STATES_DORMANT; the_thread->Wait.queue = NULL; 2008d7c: c0 26 60 44 clr [ %i1 + 0x44 ] case THREAD_CPU_BUDGET_ALGORITHM_CALLOUT: break; #endif } the_thread->Start.isr_level = isr_level; 2008d80: c2 26 60 ac st %g1, [ %i1 + 0xac ] the_thread->current_state = STATES_DORMANT; 2008d84: 82 10 20 01 mov 1, %g1 2008d88: c2 26 60 10 st %g1, [ %i1 + 0x10 ] */ RTEMS_INLINE_ROUTINE void* _Scheduler_Allocate( Thread_Control *the_thread ) { return _Scheduler.Operations.allocate( the_thread ); 2008d8c: 03 00 80 6f sethi %hi(0x201bc00), %g1 2008d90: c2 00 60 9c ld [ %g1 + 0x9c ], %g1 ! 201bc9c <_Scheduler+0x18> the_thread->Wait.queue = NULL; the_thread->resource_count = 0; 2008d94: c0 26 60 1c clr [ %i1 + 0x1c ] the_thread->real_priority = priority; 2008d98: fa 26 60 18 st %i5, [ %i1 + 0x18 ] the_thread->Start.initial_priority = priority; 2008d9c: fa 26 60 b0 st %i5, [ %i1 + 0xb0 ] 2008da0: 9f c0 40 00 call %g1 2008da4: 90 10 00 19 mov %i1, %o0 sched =_Scheduler_Allocate( the_thread ); if ( !sched ) 2008da8: b4 92 20 00 orcc %o0, 0, %i2 2008dac: 02 80 00 15 be 2008e00 <_Thread_Initialize+0x1a8> 2008db0: 90 10 00 19 mov %i1, %o0 goto failed; _Thread_Set_priority( the_thread, priority ); 2008db4: 40 00 01 97 call 2009410 <_Thread_Set_priority> 2008db8: 92 10 00 1d mov %i5, %o1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008dbc: c4 06 20 1c ld [ %i0 + 0x1c ], %g2 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 2008dc0: 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 ); 2008dc4: c0 26 60 84 clr [ %i1 + 0x84 ] 2008dc8: c0 26 60 88 clr [ %i1 + 0x88 ] #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2008dcc: 83 28 60 02 sll %g1, 2, %g1 2008dd0: f2 20 80 01 st %i1, [ %g2 + %g1 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 2008dd4: 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 ); 2008dd8: 90 10 00 19 mov %i1, %o0 2008ddc: 40 00 02 bc call 20098cc <_User_extensions_Thread_create> 2008de0: b0 10 20 01 mov 1, %i0 if ( extension_status ) 2008de4: 80 8a 20 ff btst 0xff, %o0 2008de8: 02 80 00 06 be 2008e00 <_Thread_Initialize+0x1a8> 2008dec: 01 00 00 00 nop 2008df0: b0 0e 20 01 and %i0, 1, %i0 2008df4: 81 c7 e0 08 ret 2008df8: 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; 2008dfc: 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 ); 2008e00: 40 00 03 cb call 2009d2c <_Workspace_Free> 2008e04: d0 06 61 54 ld [ %i1 + 0x154 ], %o0 for ( i=0 ; i <= THREAD_API_LAST ; i++ ) _Workspace_Free( the_thread->API_Extensions[i] ); 2008e08: 40 00 03 c9 call 2009d2c <_Workspace_Free> 2008e0c: d0 06 61 58 ld [ %i1 + 0x158 ], %o0 2008e10: 40 00 03 c7 call 2009d2c <_Workspace_Free> 2008e14: d0 06 61 5c ld [ %i1 + 0x15c ], %o0 _Workspace_Free( extensions_area ); 2008e18: 40 00 03 c5 call 2009d2c <_Workspace_Free> 2008e1c: 90 10 00 1c mov %i4, %o0 #if ( CPU_HARDWARE_FP == TRUE ) || ( CPU_SOFTWARE_FP == TRUE ) _Workspace_Free( fp_area ); 2008e20: 40 00 03 c3 call 2009d2c <_Workspace_Free> 2008e24: 90 10 00 1b mov %i3, %o0 #endif _Workspace_Free( sched ); 2008e28: 40 00 03 c1 call 2009d2c <_Workspace_Free> 2008e2c: 90 10 00 1a mov %i2, %o0 _Thread_Stack_Free( the_thread ); 2008e30: 40 00 01 b7 call 200950c <_Thread_Stack_Free> 2008e34: 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 */ 2008e38: b0 10 20 00 clr %i0 _Workspace_Free( sched ); _Thread_Stack_Free( the_thread ); return false; } 2008e3c: b0 0e 20 01 and %i0, 1, %i0 2008e40: 81 c7 e0 08 ret 2008e44: 81 e8 00 00 restore =============================================================================== 020095f4 <_Thread_Tickle_timeslice>: * * Output parameters: NONE */ void _Thread_Tickle_timeslice( void ) { 20095f4: 9d e3 bf a0 save %sp, -96, %sp Thread_Control *executing; executing = _Thread_Executing; 20095f8: 03 00 80 73 sethi %hi(0x201cc00), %g1 20095fc: fa 00 62 44 ld [ %g1 + 0x244 ], %i5 ! 201ce44 <_Per_CPU_Information+0xc> /* * If the thread is not preemptible or is not ready, then * just return. */ if ( !executing->is_preemptible ) 2009600: c2 0f 60 74 ldub [ %i5 + 0x74 ], %g1 2009604: 80 a0 60 00 cmp %g1, 0 2009608: 02 80 00 25 be 200969c <_Thread_Tickle_timeslice+0xa8> 200960c: 01 00 00 00 nop return; if ( !_States_Is_ready( executing->current_state ) ) 2009610: c2 07 60 10 ld [ %i5 + 0x10 ], %g1 2009614: 80 a0 60 00 cmp %g1, 0 2009618: 12 80 00 21 bne 200969c <_Thread_Tickle_timeslice+0xa8> 200961c: 01 00 00 00 nop /* * The cpu budget algorithm determines what happens next. */ switch ( executing->budget_algorithm ) { 2009620: c2 07 60 7c ld [ %i5 + 0x7c ], %g1 2009624: 80 a0 60 01 cmp %g1, 1 2009628: 0a 80 00 14 bcs 2009678 <_Thread_Tickle_timeslice+0x84> 200962c: 80 a0 60 02 cmp %g1, 2 2009630: 28 80 00 07 bleu,a 200964c <_Thread_Tickle_timeslice+0x58> 2009634: c2 07 60 78 ld [ %i5 + 0x78 ], %g1 2009638: 80 a0 60 03 cmp %g1, 3 200963c: 12 80 00 18 bne 200969c <_Thread_Tickle_timeslice+0xa8> <== NEVER TAKEN 2009640: 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 ) 2009644: 10 80 00 0f b 2009680 <_Thread_Tickle_timeslice+0x8c> 2009648: 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 ) { 200964c: 82 00 7f ff add %g1, -1, %g1 2009650: 80 a0 60 00 cmp %g1, 0 2009654: 14 80 00 09 bg 2009678 <_Thread_Tickle_timeslice+0x84> 2009658: 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(); 200965c: 03 00 80 6f sethi %hi(0x201bc00), %g1 2009660: c2 00 60 90 ld [ %g1 + 0x90 ], %g1 ! 201bc90 <_Scheduler+0xc> 2009664: 9f c0 40 00 call %g1 2009668: 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; 200966c: 03 00 80 72 sethi %hi(0x201c800), %g1 2009670: c2 00 60 64 ld [ %g1 + 0x64 ], %g1 ! 201c864 <_Thread_Ticks_per_timeslice> 2009674: c2 27 60 78 st %g1, [ %i5 + 0x78 ] 2009678: 81 c7 e0 08 ret 200967c: 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 ) 2009680: 82 00 7f ff add %g1, -1, %g1 2009684: 80 a0 60 00 cmp %g1, 0 2009688: 12 bf ff fc bne 2009678 <_Thread_Tickle_timeslice+0x84> 200968c: c2 27 60 78 st %g1, [ %i5 + 0x78 ] (*executing->budget_callout)( executing ); 2009690: c2 07 60 80 ld [ %i5 + 0x80 ], %g1 2009694: 9f c0 40 00 call %g1 2009698: 90 10 00 1d mov %i5, %o0 200969c: 81 c7 e0 08 ret 20096a0: 81 e8 00 00 restore =============================================================================== 020090f4 <_Thread_queue_Enqueue_priority>: Thread_blocking_operation_States _Thread_queue_Enqueue_priority ( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread, ISR_Level *level_p ) { 20090f4: 9d e3 bf a0 save %sp, -96, %sp Priority_Control priority; States_Control block_state; _Chain_Initialize_empty( &the_thread->Wait.Block2n ); priority = the_thread->current_priority; 20090f8: f8 06 60 14 ld [ %i1 + 0x14 ], %i4 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 ); 20090fc: 82 06 60 38 add %i1, 0x38, %g1 2009100: 84 06 60 3c add %i1, 0x3c, %g2 head->next = tail; head->previous = NULL; tail->previous = head; 2009104: c2 26 60 40 st %g1, [ %i1 + 0x40 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2009108: c4 26 60 38 st %g2, [ %i1 + 0x38 ] head->previous = NULL; 200910c: c0 26 60 3c clr [ %i1 + 0x3c ] RTEMS_INLINE_ROUTINE uint32_t _Thread_queue_Header_number ( Priority_Control the_priority ) { return (the_priority / TASK_QUEUE_DATA_PRIORITIES_PER_HEADER); 2009110: 83 37 20 06 srl %i4, 6, %g1 header_index = _Thread_queue_Header_number( priority ); header = &the_thread_queue->Queues.Priority[ header_index ]; block_state = the_thread_queue->state; 2009114: e2 06 20 38 ld [ %i0 + 0x38 ], %l1 _Chain_Initialize_empty( &the_thread->Wait.Block2n ); priority = the_thread->current_priority; header_index = _Thread_queue_Header_number( priority ); header = &the_thread_queue->Queues.Priority[ header_index ]; 2009118: 85 28 60 02 sll %g1, 2, %g2 200911c: b7 28 60 04 sll %g1, 4, %i3 the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; 2009120: 25 00 80 6e sethi %hi(0x201b800), %l2 _Chain_Initialize_empty( &the_thread->Wait.Block2n ); priority = the_thread->current_priority; header_index = _Thread_queue_Header_number( priority ); header = &the_thread_queue->Queues.Priority[ header_index ]; 2009124: b6 26 c0 02 sub %i3, %g2, %i3 block_state = the_thread_queue->state; if ( _Thread_queue_Is_reverse_search( priority ) ) 2009128: 80 8f 20 20 btst 0x20, %i4 200912c: 12 80 00 28 bne 20091cc <_Thread_queue_Enqueue_priority+0xd8> 2009130: b6 06 00 1b add %i0, %i3, %i3 RTEMS_INLINE_ROUTINE bool _Chain_Is_tail( Chain_Control *the_chain, const Chain_Node *the_node ) { return (the_node == _Chain_Tail(the_chain)); 2009134: a4 06 e0 04 add %i3, 4, %l2 goto restart_reverse_search; restart_forward_search: search_priority = PRIORITY_MINIMUM - 1; _ISR_Disable( level ); 2009138: 7f ff e3 f5 call 200210c 200913c: 01 00 00 00 nop 2009140: 82 10 00 08 mov %o0, %g1 if ( _Thread_queue_Is_reverse_search( priority ) ) goto restart_reverse_search; restart_forward_search: search_priority = PRIORITY_MINIMUM - 1; 2009144: a0 10 3f ff mov -1, %l0 _ISR_Disable( level ); search_thread = (Thread_Control *) _Chain_First( header ); while ( !_Chain_Is_tail( header, (Chain_Node *)search_thread ) ) { 2009148: 10 80 00 11 b 200918c <_Thread_queue_Enqueue_priority+0x98> 200914c: fa 06 c0 00 ld [ %i3 ], %i5 search_priority = search_thread->current_priority; if ( priority <= search_priority ) 2009150: 80 a7 00 10 cmp %i4, %l0 2009154: 28 80 00 12 bleu,a 200919c <_Thread_queue_Enqueue_priority+0xa8> 2009158: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 break; search_priority = search_thread->current_priority; if ( priority <= search_priority ) break; #endif _ISR_Flash( level ); 200915c: 7f ff e3 f0 call 200211c 2009160: 90 10 00 01 mov %g1, %o0 2009164: 7f ff e3 ea call 200210c 2009168: 01 00 00 00 nop 200916c: 82 10 00 08 mov %o0, %g1 RTEMS_INLINE_ROUTINE bool _States_Are_set ( States_Control the_states, States_Control mask ) { return ( (the_states & mask) != STATES_READY); 2009170: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 if ( !_States_Are_set( search_thread->current_state, block_state) ) { 2009174: 80 8c 40 02 btst %l1, %g2 2009178: 32 80 00 05 bne,a 200918c <_Thread_queue_Enqueue_priority+0x98> 200917c: fa 07 40 00 ld [ %i5 ], %i5 _ISR_Enable( level ); 2009180: 7f ff e3 e7 call 200211c 2009184: 01 00 00 00 nop goto restart_forward_search; 2009188: 30 bf ff ec b,a 2009138 <_Thread_queue_Enqueue_priority+0x44> restart_forward_search: search_priority = PRIORITY_MINIMUM - 1; _ISR_Disable( level ); search_thread = (Thread_Control *) _Chain_First( header ); while ( !_Chain_Is_tail( header, (Chain_Node *)search_thread ) ) { 200918c: 80 a7 40 12 cmp %i5, %l2 2009190: 32 bf ff f0 bne,a 2009150 <_Thread_queue_Enqueue_priority+0x5c> 2009194: e0 07 60 14 ld [ %i5 + 0x14 ], %l0 } search_thread = (Thread_Control *)search_thread->Object.Node.next; } if ( the_thread_queue->sync_state != 2009198: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 200919c: 80 a0 a0 01 cmp %g2, 1 20091a0: 32 80 00 3c bne,a 2009290 <_Thread_queue_Enqueue_priority+0x19c><== NEVER TAKEN 20091a4: c2 26 80 00 st %g1, [ %i2 ] <== NOT EXECUTED THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) goto synchronize; the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED; if ( priority == search_priority ) 20091a8: 80 a7 00 10 cmp %i4, %l0 20091ac: 02 80 00 2d be 2009260 <_Thread_queue_Enqueue_priority+0x16c> 20091b0: c0 26 20 30 clr [ %i0 + 0x30 ] goto equal_priority; search_node = (Chain_Node *) search_thread; previous_node = search_node->previous; 20091b4: c4 07 60 04 ld [ %i5 + 4 ], %g2 the_node = (Chain_Node *) the_thread; the_node->next = search_node; 20091b8: fa 26 40 00 st %i5, [ %i1 ] the_node->previous = previous_node; 20091bc: c4 26 60 04 st %g2, [ %i1 + 4 ] previous_node->next = the_node; 20091c0: f2 20 80 00 st %i1, [ %g2 ] search_node->previous = the_node; 20091c4: 10 80 00 2d b 2009278 <_Thread_queue_Enqueue_priority+0x184> 20091c8: f2 27 60 04 st %i1, [ %i5 + 4 ] return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; _ISR_Disable( level ); 20091cc: 7f ff e3 d0 call 200210c 20091d0: e0 0c a3 dc ldub [ %l2 + 0x3dc ], %l0 the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; 20091d4: a0 04 20 01 inc %l0 _ISR_Disable( level ); 20091d8: 82 10 00 08 mov %o0, %g1 search_thread = (Thread_Control *) _Chain_Last( header ); while ( !_Chain_Is_head( header, (Chain_Node *)search_thread ) ) { 20091dc: 10 80 00 11 b 2009220 <_Thread_queue_Enqueue_priority+0x12c> 20091e0: fa 06 e0 08 ld [ %i3 + 8 ], %i5 search_priority = search_thread->current_priority; if ( priority >= search_priority ) 20091e4: 80 a7 00 10 cmp %i4, %l0 20091e8: 3a 80 00 12 bcc,a 2009230 <_Thread_queue_Enqueue_priority+0x13c> 20091ec: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 break; search_priority = search_thread->current_priority; if ( priority >= search_priority ) break; #endif _ISR_Flash( level ); 20091f0: 7f ff e3 cb call 200211c 20091f4: 90 10 00 01 mov %g1, %o0 20091f8: 7f ff e3 c5 call 200210c 20091fc: 01 00 00 00 nop 2009200: 82 10 00 08 mov %o0, %g1 2009204: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 if ( !_States_Are_set( search_thread->current_state, block_state) ) { 2009208: 80 8c 40 02 btst %l1, %g2 200920c: 32 80 00 05 bne,a 2009220 <_Thread_queue_Enqueue_priority+0x12c> 2009210: fa 07 60 04 ld [ %i5 + 4 ], %i5 _ISR_Enable( level ); 2009214: 7f ff e3 c2 call 200211c 2009218: 01 00 00 00 nop goto restart_reverse_search; 200921c: 30 bf ff ec b,a 20091cc <_Thread_queue_Enqueue_priority+0xd8> restart_reverse_search: search_priority = PRIORITY_MAXIMUM + 1; _ISR_Disable( level ); search_thread = (Thread_Control *) _Chain_Last( header ); while ( !_Chain_Is_head( header, (Chain_Node *)search_thread ) ) { 2009220: 80 a7 40 1b cmp %i5, %i3 2009224: 32 bf ff f0 bne,a 20091e4 <_Thread_queue_Enqueue_priority+0xf0> 2009228: e0 07 60 14 ld [ %i5 + 0x14 ], %l0 } search_thread = (Thread_Control *) search_thread->Object.Node.previous; } if ( the_thread_queue->sync_state != 200922c: c4 06 20 30 ld [ %i0 + 0x30 ], %g2 2009230: 80 a0 a0 01 cmp %g2, 1 2009234: 32 80 00 17 bne,a 2009290 <_Thread_queue_Enqueue_priority+0x19c><== NEVER TAKEN 2009238: c2 26 80 00 st %g1, [ %i2 ] <== NOT EXECUTED THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED ) goto synchronize; the_thread_queue->sync_state = THREAD_BLOCKING_OPERATION_SYNCHRONIZED; if ( priority == search_priority ) 200923c: 80 a7 00 10 cmp %i4, %l0 2009240: 02 80 00 08 be 2009260 <_Thread_queue_Enqueue_priority+0x16c> 2009244: c0 26 20 30 clr [ %i0 + 0x30 ] goto equal_priority; search_node = (Chain_Node *) search_thread; next_node = search_node->next; 2009248: c4 07 40 00 ld [ %i5 ], %g2 the_node = (Chain_Node *) the_thread; the_node->next = next_node; the_node->previous = search_node; 200924c: fa 26 60 04 st %i5, [ %i1 + 4 ] search_node = (Chain_Node *) search_thread; next_node = search_node->next; the_node = (Chain_Node *) the_thread; the_node->next = next_node; 2009250: c4 26 40 00 st %g2, [ %i1 ] the_node->previous = search_node; search_node->next = the_node; 2009254: f2 27 40 00 st %i1, [ %i5 ] next_node->previous = the_node; 2009258: 10 80 00 08 b 2009278 <_Thread_queue_Enqueue_priority+0x184> 200925c: f2 20 a0 04 st %i1, [ %g2 + 4 ] _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; equal_priority: /* add at end of priority group */ search_node = _Chain_Tail( &search_thread->Wait.Block2n ); previous_node = search_node->previous; 2009260: c4 07 60 40 ld [ %i5 + 0x40 ], %g2 the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; equal_priority: /* add at end of priority group */ search_node = _Chain_Tail( &search_thread->Wait.Block2n ); 2009264: 86 07 60 3c add %i5, 0x3c, %g3 previous_node = search_node->previous; the_node = (Chain_Node *) the_thread; the_node->next = search_node; the_node->previous = previous_node; 2009268: c4 26 60 04 st %g2, [ %i1 + 4 ] equal_priority: /* add at end of priority group */ search_node = _Chain_Tail( &search_thread->Wait.Block2n ); previous_node = search_node->previous; the_node = (Chain_Node *) the_thread; the_node->next = search_node; 200926c: c6 26 40 00 st %g3, [ %i1 ] the_node->previous = previous_node; previous_node->next = the_node; 2009270: f2 20 80 00 st %i1, [ %g2 ] search_node->previous = the_node; 2009274: f2 27 60 40 st %i1, [ %i5 + 0x40 ] the_thread->Wait.queue = the_thread_queue; 2009278: f0 26 60 44 st %i0, [ %i1 + 0x44 ] _ISR_Enable( level ); return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 200927c: b0 10 20 01 mov 1, %i0 the_node->next = search_node; the_node->previous = previous_node; previous_node->next = the_node; search_node->previous = the_node; the_thread->Wait.queue = the_thread_queue; _ISR_Enable( level ); 2009280: 7f ff e3 a7 call 200211c 2009284: 90 10 00 01 mov %g1, %o0 return THREAD_BLOCKING_OPERATION_NOTHING_HAPPENED; 2009288: 81 c7 e0 08 ret 200928c: 81 e8 00 00 restore * the mutex by an ISR or timed out. * * WARNING! Returning with interrupts disabled! */ *level_p = level; return the_thread_queue->sync_state; 2009290: f0 06 20 30 ld [ %i0 + 0x30 ], %i0 <== NOT EXECUTED } 2009294: 81 c7 e0 08 ret <== NOT EXECUTED 2009298: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02009358 <_Thread_queue_Requeue>: void _Thread_queue_Requeue( Thread_queue_Control *the_thread_queue, Thread_Control *the_thread ) { 2009358: 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 ) 200935c: 80 a6 20 00 cmp %i0, 0 2009360: 02 80 00 19 be 20093c4 <_Thread_queue_Requeue+0x6c> <== NEVER TAKEN 2009364: 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 ) { 2009368: f8 06 20 34 ld [ %i0 + 0x34 ], %i4 200936c: 80 a7 20 01 cmp %i4, 1 2009370: 12 80 00 15 bne 20093c4 <_Thread_queue_Requeue+0x6c> <== NEVER TAKEN 2009374: 01 00 00 00 nop Thread_queue_Control *tq = the_thread_queue; ISR_Level level; ISR_Level level_ignored; _ISR_Disable( level ); 2009378: 7f ff e3 65 call 200210c 200937c: 01 00 00 00 nop 2009380: ba 10 00 08 mov %o0, %i5 2009384: c4 06 60 10 ld [ %i1 + 0x10 ], %g2 if ( _States_Is_waiting_on_thread_queue( the_thread->current_state ) ) { 2009388: 03 00 00 ef sethi %hi(0x3bc00), %g1 200938c: 82 10 62 e0 or %g1, 0x2e0, %g1 ! 3bee0 2009390: 80 88 80 01 btst %g2, %g1 2009394: 02 80 00 0a be 20093bc <_Thread_queue_Requeue+0x64> <== NEVER TAKEN 2009398: 90 10 00 18 mov %i0, %o0 _Thread_queue_Enter_critical_section( tq ); _Thread_queue_Extract_priority_helper( tq, the_thread, true ); 200939c: 92 10 00 19 mov %i1, %o1 20093a0: 94 10 20 01 mov 1, %o2 20093a4: 40 00 0e 1e call 200cc1c <_Thread_queue_Extract_priority_helper> 20093a8: f8 26 20 30 st %i4, [ %i0 + 0x30 ] (void) _Thread_queue_Enqueue_priority( tq, the_thread, &level_ignored ); 20093ac: 90 10 00 18 mov %i0, %o0 20093b0: 92 10 00 19 mov %i1, %o1 20093b4: 7f ff ff 50 call 20090f4 <_Thread_queue_Enqueue_priority> 20093b8: 94 07 bf fc add %fp, -4, %o2 } _ISR_Enable( level ); 20093bc: 7f ff e3 58 call 200211c 20093c0: 90 10 00 1d mov %i5, %o0 20093c4: 81 c7 e0 08 ret 20093c8: 81 e8 00 00 restore =============================================================================== 020093cc <_Thread_queue_Timeout>: void _Thread_queue_Timeout( Objects_Id id, void *ignored __attribute__((unused)) ) { 20093cc: 9d e3 bf 98 save %sp, -104, %sp Thread_Control *the_thread; Objects_Locations location; the_thread = _Thread_Get( id, &location ); 20093d0: 90 10 00 18 mov %i0, %o0 20093d4: 7f ff fd f5 call 2008ba8 <_Thread_Get> 20093d8: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20093dc: c2 07 bf fc ld [ %fp + -4 ], %g1 20093e0: 80 a0 60 00 cmp %g1, 0 20093e4: 12 80 00 09 bne 2009408 <_Thread_queue_Timeout+0x3c> <== NEVER TAKEN 20093e8: 01 00 00 00 nop #if defined(RTEMS_MULTIPROCESSING) case OBJECTS_REMOTE: /* impossible */ #endif break; case OBJECTS_LOCAL: _Thread_queue_Process_timeout( the_thread ); 20093ec: 40 00 0e 43 call 200ccf8 <_Thread_queue_Process_timeout> 20093f0: 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--; 20093f4: 03 00 80 72 sethi %hi(0x201c800), %g1 20093f8: c4 00 61 00 ld [ %g1 + 0x100 ], %g2 ! 201c900 <_Thread_Dispatch_disable_level> 20093fc: 84 00 bf ff add %g2, -1, %g2 2009400: c4 20 61 00 st %g2, [ %g1 + 0x100 ] return _Thread_Dispatch_disable_level; 2009404: c2 00 61 00 ld [ %g1 + 0x100 ], %g1 2009408: 81 c7 e0 08 ret 200940c: 81 e8 00 00 restore =============================================================================== 02016d3c <_Timer_server_Body>: * @a arg points to the corresponding timer server control block. */ static rtems_task _Timer_server_Body( rtems_task_argument arg ) { 2016d3c: 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; 2016d40: 27 00 80 f6 sethi %hi(0x203d800), %l3 ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2016d44: a8 07 bf e8 add %fp, -24, %l4 2016d48: a4 07 bf ec add %fp, -20, %l2 2016d4c: b6 07 bf f4 add %fp, -12, %i3 2016d50: b4 07 bf f8 add %fp, -8, %i2 2016d54: e4 27 bf e8 st %l2, [ %fp + -24 ] head->previous = NULL; 2016d58: c0 27 bf ec clr [ %fp + -20 ] tail->previous = head; 2016d5c: 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; 2016d60: f4 27 bf f4 st %i2, [ %fp + -12 ] head->previous = NULL; 2016d64: c0 27 bf f8 clr [ %fp + -8 ] tail->previous = head; 2016d68: 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 ); 2016d6c: 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 ); 2016d70: 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 ); 2016d74: 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 ); 2016d78: 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; 2016d7c: 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(); 2016d80: 2b 00 80 f6 sethi %hi(0x203d800), %l5 static void _Timer_server_Process_interval_watchdogs( Timer_server_Watchdogs *watchdogs, Chain_Control *fire_chain ) { Watchdog_Interval snapshot = _Watchdog_Ticks_since_boot; 2016d84: c2 04 e1 84 ld [ %l3 + 0x184 ], %g1 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; 2016d88: d2 06 20 3c ld [ %i0 + 0x3c ], %o1 watchdogs->last_snapshot = snapshot; _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2016d8c: 94 10 00 1b mov %i3, %o2 /* * We assume adequate unsigned arithmetic here. */ Watchdog_Interval delta = snapshot - watchdogs->last_snapshot; watchdogs->last_snapshot = snapshot; 2016d90: c2 26 20 3c st %g1, [ %i0 + 0x3c ] _Watchdog_Adjust_to_chain( &watchdogs->Chain, delta, fire_chain ); 2016d94: 90 10 00 19 mov %i1, %o0 2016d98: 40 00 11 de call 201b510 <_Watchdog_Adjust_to_chain> 2016d9c: 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; 2016da0: 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(); 2016da4: fa 05 60 fc ld [ %l5 + 0xfc ], %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 ) { 2016da8: 80 a7 40 0a cmp %i5, %o2 2016dac: 08 80 00 06 bleu 2016dc4 <_Timer_server_Body+0x88> 2016db0: 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 ); 2016db4: 90 10 00 1c mov %i4, %o0 2016db8: 40 00 11 d6 call 201b510 <_Watchdog_Adjust_to_chain> 2016dbc: 94 10 00 1b mov %i3, %o2 2016dc0: 30 80 00 06 b,a 2016dd8 <_Timer_server_Body+0x9c> } else if ( snapshot < last_snapshot ) { 2016dc4: 1a 80 00 05 bcc 2016dd8 <_Timer_server_Body+0x9c> 2016dc8: 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 ); 2016dcc: 92 10 20 01 mov 1, %o1 2016dd0: 40 00 11 a9 call 201b474 <_Watchdog_Adjust> 2016dd4: 94 22 80 1d sub %o2, %i5, %o2 } watchdogs->last_snapshot = snapshot; 2016dd8: 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 ); 2016ddc: d0 06 20 78 ld [ %i0 + 0x78 ], %o0 2016de0: 40 00 02 d2 call 2017928 <_Chain_Get> 2016de4: 01 00 00 00 nop if ( timer == NULL ) { 2016de8: 92 92 20 00 orcc %o0, 0, %o1 2016dec: 02 80 00 0c be 2016e1c <_Timer_server_Body+0xe0> 2016df0: 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 ) { 2016df4: c2 02 60 38 ld [ %o1 + 0x38 ], %g1 2016df8: 80 a0 60 01 cmp %g1, 1 2016dfc: 02 80 00 05 be 2016e10 <_Timer_server_Body+0xd4> 2016e00: 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 ) { 2016e04: 80 a0 60 03 cmp %g1, 3 2016e08: 12 bf ff f5 bne 2016ddc <_Timer_server_Body+0xa0> <== NEVER TAKEN 2016e0c: 90 10 00 1c mov %i4, %o0 _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2016e10: 40 00 11 f2 call 201b5d8 <_Watchdog_Insert> 2016e14: 92 02 60 10 add %o1, 0x10, %o1 2016e18: 30 bf ff f1 b,a 2016ddc <_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 ); 2016e1c: 7f ff e3 82 call 200fc24 2016e20: 01 00 00 00 nop if ( _Chain_Is_empty( insert_chain ) ) { 2016e24: c2 07 bf e8 ld [ %fp + -24 ], %g1 2016e28: 80 a0 40 12 cmp %g1, %l2 2016e2c: 12 80 00 0a bne 2016e54 <_Timer_server_Body+0x118> <== NEVER TAKEN 2016e30: 01 00 00 00 nop ts->insert_chain = NULL; 2016e34: c0 26 20 78 clr [ %i0 + 0x78 ] _ISR_Enable( level ); 2016e38: 7f ff e3 7f call 200fc34 2016e3c: 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 ) ) { 2016e40: c2 07 bf f4 ld [ %fp + -12 ], %g1 2016e44: 80 a0 40 1a cmp %g1, %i2 2016e48: 12 80 00 06 bne 2016e60 <_Timer_server_Body+0x124> 2016e4c: 01 00 00 00 nop 2016e50: 30 80 00 18 b,a 2016eb0 <_Timer_server_Body+0x174> ts->insert_chain = NULL; _ISR_Enable( level ); break; } else { _ISR_Enable( level ); 2016e54: 7f ff e3 78 call 200fc34 <== NOT EXECUTED 2016e58: 01 00 00 00 nop <== NOT EXECUTED 2016e5c: 30 bf ff ca b,a 2016d84 <_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 ); 2016e60: 7f ff e3 71 call 200fc24 2016e64: 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; 2016e68: 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)) 2016e6c: 80 a7 40 1a cmp %i5, %i2 2016e70: 02 80 00 0d be 2016ea4 <_Timer_server_Body+0x168> 2016e74: 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; 2016e78: c2 07 40 00 ld [ %i5 ], %g1 head->next = new_first; new_first->previous = head; 2016e7c: 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; 2016e80: c2 27 bf f4 st %g1, [ %fp + -12 ] watchdog = (Watchdog_Control *) _Chain_Get_unprotected( &fire_chain ); if ( watchdog != NULL ) { watchdog->state = WATCHDOG_INACTIVE; 2016e84: c0 27 60 08 clr [ %i5 + 8 ] _ISR_Enable( level ); 2016e88: 7f ff e3 6b call 200fc34 2016e8c: 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 ); 2016e90: c2 07 60 1c ld [ %i5 + 0x1c ], %g1 2016e94: d0 07 60 20 ld [ %i5 + 0x20 ], %o0 2016e98: 9f c0 40 00 call %g1 2016e9c: d2 07 60 24 ld [ %i5 + 0x24 ], %o1 } 2016ea0: 30 bf ff f0 b,a 2016e60 <_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 ); 2016ea4: 7f ff e3 64 call 200fc34 2016ea8: 01 00 00 00 nop 2016eac: 30 bf ff b4 b,a 2016d7c <_Timer_server_Body+0x40> * the active flag of the timer server is true. */ (*watchdog->routine)( watchdog->id, watchdog->user_data ); } } else { ts->active = false; 2016eb0: c0 2e 20 7c clrb [ %i0 + 0x7c ] /* * Block until there is something to do. */ _Thread_Disable_dispatch(); 2016eb4: 7f ff ff 73 call 2016c80 <_Thread_Disable_dispatch> 2016eb8: 01 00 00 00 nop _Thread_Set_state( ts->thread, STATES_DELAYING ); 2016ebc: d0 06 00 00 ld [ %i0 ], %o0 2016ec0: 40 00 0f c7 call 201addc <_Thread_Set_state> 2016ec4: 92 10 20 08 mov 8, %o1 _Timer_server_Reset_interval_system_watchdog( ts ); 2016ec8: 7f ff ff 75 call 2016c9c <_Timer_server_Reset_interval_system_watchdog> 2016ecc: 90 10 00 18 mov %i0, %o0 _Timer_server_Reset_tod_system_watchdog( ts ); 2016ed0: 7f ff ff 87 call 2016cec <_Timer_server_Reset_tod_system_watchdog> 2016ed4: 90 10 00 18 mov %i0, %o0 _Thread_Enable_dispatch(); 2016ed8: 40 00 0d 70 call 201a498 <_Thread_Enable_dispatch> 2016edc: 01 00 00 00 nop ts->active = true; 2016ee0: 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 ); 2016ee4: 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; 2016ee8: 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 ); 2016eec: 40 00 12 15 call 201b740 <_Watchdog_Remove> 2016ef0: 01 00 00 00 nop static void _Timer_server_Stop_tod_system_watchdog( Timer_server_Control *ts ) { _Watchdog_Remove( &ts->TOD_watchdogs.System_watchdog ); 2016ef4: 40 00 12 13 call 201b740 <_Watchdog_Remove> 2016ef8: 90 10 00 10 mov %l0, %o0 2016efc: 30 bf ff a0 b,a 2016d7c <_Timer_server_Body+0x40> =============================================================================== 02016f00 <_Timer_server_Schedule_operation_method>: static void _Timer_server_Schedule_operation_method( Timer_server_Control *ts, Timer_Control *timer ) { 2016f00: 9d e3 bf a0 save %sp, -96, %sp if ( ts->insert_chain == NULL ) { 2016f04: c2 06 20 78 ld [ %i0 + 0x78 ], %g1 2016f08: 80 a0 60 00 cmp %g1, 0 2016f0c: 12 80 00 49 bne 2017030 <_Timer_server_Schedule_operation_method+0x130> 2016f10: 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(); 2016f14: 7f ff ff 5b call 2016c80 <_Thread_Disable_dispatch> 2016f18: 01 00 00 00 nop if ( timer->the_class == TIMER_INTERVAL_ON_TASK ) { 2016f1c: c2 06 60 38 ld [ %i1 + 0x38 ], %g1 2016f20: 80 a0 60 01 cmp %g1, 1 2016f24: 12 80 00 1f bne 2016fa0 <_Timer_server_Schedule_operation_method+0xa0> 2016f28: 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 ); 2016f2c: 7f ff e3 3e call 200fc24 2016f30: 01 00 00 00 nop snapshot = _Watchdog_Ticks_since_boot; 2016f34: 03 00 80 f6 sethi %hi(0x203d800), %g1 2016f38: c4 00 61 84 ld [ %g1 + 0x184 ], %g2 ! 203d984 <_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; 2016f3c: c2 06 20 30 ld [ %i0 + 0x30 ], %g1 last_snapshot = ts->Interval_watchdogs.last_snapshot; 2016f40: 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 ); 2016f44: 86 06 20 34 add %i0, 0x34, %g3 if ( !_Chain_Is_empty( &ts->Interval_watchdogs.Chain ) ) { 2016f48: 80 a0 40 03 cmp %g1, %g3 2016f4c: 02 80 00 08 be 2016f6c <_Timer_server_Schedule_operation_method+0x6c> 2016f50: 88 20 80 04 sub %g2, %g4, %g4 /* * We assume adequate unsigned arithmetic here. */ delta = snapshot - last_snapshot; delta_interval = first_watchdog->delta_interval; 2016f54: de 00 60 10 ld [ %g1 + 0x10 ], %o7 if (delta_interval > delta) { 2016f58: 80 a3 c0 04 cmp %o7, %g4 2016f5c: 08 80 00 03 bleu 2016f68 <_Timer_server_Schedule_operation_method+0x68> 2016f60: 86 10 20 00 clr %g3 delta_interval -= delta; 2016f64: 86 23 c0 04 sub %o7, %g4, %g3 } else { delta_interval = 0; } first_watchdog->delta_interval = delta_interval; 2016f68: c6 20 60 10 st %g3, [ %g1 + 0x10 ] } ts->Interval_watchdogs.last_snapshot = snapshot; 2016f6c: c4 26 20 3c st %g2, [ %i0 + 0x3c ] _ISR_Enable( level ); 2016f70: 7f ff e3 31 call 200fc34 2016f74: 01 00 00 00 nop _Watchdog_Insert( &ts->Interval_watchdogs.Chain, &timer->Ticker ); 2016f78: 90 06 20 30 add %i0, 0x30, %o0 2016f7c: 40 00 11 97 call 201b5d8 <_Watchdog_Insert> 2016f80: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 2016f84: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2016f88: 80 a0 60 00 cmp %g1, 0 2016f8c: 12 80 00 27 bne 2017028 <_Timer_server_Schedule_operation_method+0x128> 2016f90: 01 00 00 00 nop _Timer_server_Reset_interval_system_watchdog( ts ); 2016f94: 7f ff ff 42 call 2016c9c <_Timer_server_Reset_interval_system_watchdog> 2016f98: 90 10 00 18 mov %i0, %o0 2016f9c: 30 80 00 23 b,a 2017028 <_Timer_server_Schedule_operation_method+0x128> } } else if ( timer->the_class == TIMER_TIME_OF_DAY_ON_TASK ) { 2016fa0: 12 80 00 22 bne 2017028 <_Timer_server_Schedule_operation_method+0x128> 2016fa4: 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 ); 2016fa8: 7f ff e3 1f call 200fc24 2016fac: 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; 2016fb0: c4 06 20 68 ld [ %i0 + 0x68 ], %g2 snapshot = (Watchdog_Interval) _TOD_Seconds_since_epoch(); last_snapshot = ts->TOD_watchdogs.last_snapshot; 2016fb4: 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(); 2016fb8: 03 00 80 f6 sethi %hi(0x203d800), %g1 RTEMS_INLINE_ROUTINE bool _Chain_Is_empty( const Chain_Control *the_chain ) { return _Chain_Immutable_first( the_chain ) == _Chain_Immutable_tail( the_chain ); 2016fbc: 86 06 20 6c add %i0, 0x6c, %g3 last_snapshot = ts->TOD_watchdogs.last_snapshot; if ( !_Chain_Is_empty( &ts->TOD_watchdogs.Chain ) ) { 2016fc0: 80 a0 80 03 cmp %g2, %g3 2016fc4: 02 80 00 0d be 2016ff8 <_Timer_server_Schedule_operation_method+0xf8> 2016fc8: c2 00 60 fc ld [ %g1 + 0xfc ], %g1 first_watchdog = _Watchdog_First( &ts->TOD_watchdogs.Chain ); delta_interval = first_watchdog->delta_interval; 2016fcc: c8 00 a0 10 ld [ %g2 + 0x10 ], %g4 if ( snapshot > last_snapshot ) { 2016fd0: 80 a0 40 0f cmp %g1, %o7 } } else { /* * Someone put us in the past. */ delta = last_snapshot - snapshot; 2016fd4: 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 ) { 2016fd8: 08 80 00 07 bleu 2016ff4 <_Timer_server_Schedule_operation_method+0xf4> 2016fdc: 86 20 c0 01 sub %g3, %g1, %g3 /* * We advanced in time. */ delta = snapshot - last_snapshot; 2016fe0: 9e 20 40 0f sub %g1, %o7, %o7 if (delta_interval > delta) { 2016fe4: 80 a1 00 0f cmp %g4, %o7 2016fe8: 08 80 00 03 bleu 2016ff4 <_Timer_server_Schedule_operation_method+0xf4><== NEVER TAKEN 2016fec: 86 10 20 00 clr %g3 delta_interval -= delta; 2016ff0: 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; 2016ff4: c6 20 a0 10 st %g3, [ %g2 + 0x10 ] } ts->TOD_watchdogs.last_snapshot = snapshot; 2016ff8: c2 26 20 74 st %g1, [ %i0 + 0x74 ] _ISR_Enable( level ); 2016ffc: 7f ff e3 0e call 200fc34 2017000: 01 00 00 00 nop _Watchdog_Insert( &ts->TOD_watchdogs.Chain, &timer->Ticker ); 2017004: 90 06 20 68 add %i0, 0x68, %o0 2017008: 40 00 11 74 call 201b5d8 <_Watchdog_Insert> 201700c: 92 07 60 10 add %i5, 0x10, %o1 if ( !ts->active ) { 2017010: c2 0e 20 7c ldub [ %i0 + 0x7c ], %g1 2017014: 80 a0 60 00 cmp %g1, 0 2017018: 12 80 00 04 bne 2017028 <_Timer_server_Schedule_operation_method+0x128> 201701c: 01 00 00 00 nop _Timer_server_Reset_tod_system_watchdog( ts ); 2017020: 7f ff ff 33 call 2016cec <_Timer_server_Reset_tod_system_watchdog> 2017024: 90 10 00 18 mov %i0, %o0 } } _Thread_Enable_dispatch(); 2017028: 40 00 0d 1c call 201a498 <_Thread_Enable_dispatch> 201702c: 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 ); 2017030: f0 06 20 78 ld [ %i0 + 0x78 ], %i0 2017034: 40 00 02 29 call 20178d8 <_Chain_Append> 2017038: 81 e8 00 00 restore =============================================================================== 0200974c <_User_extensions_Handler_initialization>: #include #include #include void _User_extensions_Handler_initialization(void) { 200974c: 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; 2009750: 03 00 80 6e sethi %hi(0x201b800), %g1 2009754: 82 10 63 9c or %g1, 0x39c, %g1 ! 201bb9c ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2009758: 05 00 80 72 sethi %hi(0x201c800), %g2 initial_extensions = Configuration.User_extension_table; 200975c: 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; 2009760: f6 00 60 38 ld [ %g1 + 0x38 ], %i3 2009764: 82 10 a2 e8 or %g2, 0x2e8, %g1 2009768: 86 00 60 04 add %g1, 4, %g3 head->previous = NULL; 200976c: c0 20 60 04 clr [ %g1 + 4 ] tail->previous = head; 2009770: 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; 2009774: c6 20 a2 e8 st %g3, [ %g2 + 0x2e8 ] 2009778: 05 00 80 72 sethi %hi(0x201c800), %g2 200977c: 82 10 a1 04 or %g2, 0x104, %g1 ! 201c904 <_User_extensions_Switches_list> 2009780: 86 00 60 04 add %g1, 4, %g3 head->previous = NULL; 2009784: c0 20 60 04 clr [ %g1 + 4 ] ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2009788: c6 20 a1 04 st %g3, [ %g2 + 0x104 ] initial_extensions = Configuration.User_extension_table; _Chain_Initialize_empty( &_User_extensions_List ); _Chain_Initialize_empty( &_User_extensions_Switches_list ); if ( initial_extensions ) { 200978c: 80 a6 a0 00 cmp %i2, 0 2009790: 02 80 00 1b be 20097fc <_User_extensions_Handler_initialization+0xb0><== NEVER TAKEN 2009794: c2 20 60 08 st %g1, [ %g1 + 8 ] extension = (User_extensions_Control *) _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) 2009798: 83 2e e0 02 sll %i3, 2, %g1 200979c: bb 2e e0 04 sll %i3, 4, %i5 20097a0: ba 27 40 01 sub %i5, %g1, %i5 20097a4: ba 07 40 1b add %i5, %i3, %i5 20097a8: 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 *) 20097ac: 40 00 01 66 call 2009d44 <_Workspace_Allocate_or_fatal_error> 20097b0: 90 10 00 1d mov %i5, %o0 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 20097b4: 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 *) 20097b8: b8 10 00 08 mov %o0, %i4 _Workspace_Allocate_or_fatal_error( number_of_extensions * sizeof( User_extensions_Control ) ); memset ( 20097bc: 92 10 20 00 clr %o1 20097c0: 40 00 16 f6 call 200f398 20097c4: ba 10 20 00 clr %i5 extension, 0, number_of_extensions * sizeof( User_extensions_Control ) ); for ( i = 0 ; i < number_of_extensions ; i++ ) { 20097c8: 10 80 00 0b b 20097f4 <_User_extensions_Handler_initialization+0xa8> 20097cc: 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; 20097d0: 90 07 20 14 add %i4, 0x14, %o0 20097d4: 92 06 80 09 add %i2, %o1, %o1 20097d8: 40 00 16 b4 call 200f2a8 20097dc: 94 10 20 20 mov 0x20, %o2 _User_extensions_Add_set( extension ); 20097e0: 90 10 00 1c mov %i4, %o0 20097e4: 40 00 0d 85 call 200cdf8 <_User_extensions_Add_set> 20097e8: ba 07 60 01 inc %i5 _User_extensions_Add_set_with_table (extension, &initial_extensions[i]); extension++; 20097ec: 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++ ) { 20097f0: 80 a7 40 1b cmp %i5, %i3 20097f4: 12 bf ff f7 bne 20097d0 <_User_extensions_Handler_initialization+0x84> 20097f8: 93 2f 60 05 sll %i5, 5, %o1 20097fc: 81 c7 e0 08 ret 2009800: 81 e8 00 00 restore =============================================================================== 0200b4b4 <_Watchdog_Adjust>: void _Watchdog_Adjust( Chain_Control *header, Watchdog_Adjust_directions direction, Watchdog_Interval units ) { 200b4b4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; _ISR_Disable( level ); 200b4b8: 7f ff de af call 2002f74 200b4bc: 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; 200b4c0: 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 ); 200b4c4: 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 ) ) { 200b4c8: 80 a0 40 1c cmp %g1, %i4 200b4cc: 02 80 00 1f be 200b548 <_Watchdog_Adjust+0x94> 200b4d0: 80 a6 60 00 cmp %i1, 0 switch ( direction ) { 200b4d4: 02 80 00 1a be 200b53c <_Watchdog_Adjust+0x88> 200b4d8: b6 10 20 01 mov 1, %i3 200b4dc: 80 a6 60 01 cmp %i1, 1 200b4e0: 12 80 00 1a bne 200b548 <_Watchdog_Adjust+0x94> <== NEVER TAKEN 200b4e4: 01 00 00 00 nop case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; 200b4e8: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200b4ec: 10 80 00 07 b 200b508 <_Watchdog_Adjust+0x54> 200b4f0: b4 00 80 1a add %g2, %i2, %i2 break; case WATCHDOG_FORWARD: while ( units ) { if ( units < _Watchdog_First( header )->delta_interval ) { 200b4f4: c4 00 60 10 ld [ %g1 + 0x10 ], %g2 200b4f8: 80 a6 80 02 cmp %i2, %g2 200b4fc: 3a 80 00 05 bcc,a 200b510 <_Watchdog_Adjust+0x5c> 200b500: f6 20 60 10 st %i3, [ %g1 + 0x10 ] _Watchdog_First( header )->delta_interval -= units; 200b504: b4 20 80 1a sub %g2, %i2, %i2 break; 200b508: 10 80 00 10 b 200b548 <_Watchdog_Adjust+0x94> 200b50c: f4 20 60 10 st %i2, [ %g1 + 0x10 ] } else { units -= _Watchdog_First( header )->delta_interval; 200b510: b4 26 80 02 sub %i2, %g2, %i2 _Watchdog_First( header )->delta_interval = 1; _ISR_Enable( level ); 200b514: 7f ff de 9c call 2002f84 200b518: 01 00 00 00 nop _Watchdog_Tickle( header ); 200b51c: 40 00 00 90 call 200b75c <_Watchdog_Tickle> 200b520: 90 10 00 1d mov %i5, %o0 _ISR_Disable( level ); 200b524: 7f ff de 94 call 2002f74 200b528: 01 00 00 00 nop if ( _Chain_Is_empty( header ) ) 200b52c: c2 07 40 00 ld [ %i5 ], %g1 200b530: 80 a0 40 1c cmp %g1, %i4 200b534: 02 80 00 05 be 200b548 <_Watchdog_Adjust+0x94> 200b538: 01 00 00 00 nop switch ( direction ) { case WATCHDOG_BACKWARD: _Watchdog_First( header )->delta_interval += units; break; case WATCHDOG_FORWARD: while ( units ) { 200b53c: 80 a6 a0 00 cmp %i2, 0 200b540: 32 bf ff ed bne,a 200b4f4 <_Watchdog_Adjust+0x40> <== ALWAYS TAKEN 200b544: c2 07 40 00 ld [ %i5 ], %g1 } break; } } _ISR_Enable( level ); 200b548: 7f ff de 8f call 2002f84 200b54c: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02009b64 <_Watchdog_Remove>: */ Watchdog_States _Watchdog_Remove( Watchdog_Control *the_watchdog ) { 2009b64: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Watchdog_States previous_state; Watchdog_Control *next_watchdog; _ISR_Disable( level ); 2009b68: 7f ff e1 69 call 200210c 2009b6c: ba 10 00 18 mov %i0, %i5 previous_state = the_watchdog->state; 2009b70: f0 06 20 08 ld [ %i0 + 8 ], %i0 switch ( previous_state ) { 2009b74: 80 a6 20 01 cmp %i0, 1 2009b78: 22 80 00 1d be,a 2009bec <_Watchdog_Remove+0x88> 2009b7c: c0 27 60 08 clr [ %i5 + 8 ] 2009b80: 0a 80 00 1c bcs 2009bf0 <_Watchdog_Remove+0x8c> 2009b84: 03 00 80 72 sethi %hi(0x201c800), %g1 2009b88: 80 a6 20 03 cmp %i0, 3 2009b8c: 18 80 00 19 bgu 2009bf0 <_Watchdog_Remove+0x8c> <== NEVER TAKEN 2009b90: 01 00 00 00 nop 2009b94: c2 07 40 00 ld [ %i5 ], %g1 break; case WATCHDOG_ACTIVE: case WATCHDOG_REMOVE_IT: the_watchdog->state = WATCHDOG_INACTIVE; 2009b98: c0 27 60 08 clr [ %i5 + 8 ] next_watchdog = _Watchdog_Next( the_watchdog ); if ( _Watchdog_Next(next_watchdog) ) 2009b9c: c4 00 40 00 ld [ %g1 ], %g2 2009ba0: 80 a0 a0 00 cmp %g2, 0 2009ba4: 02 80 00 07 be 2009bc0 <_Watchdog_Remove+0x5c> 2009ba8: 05 00 80 72 sethi %hi(0x201c800), %g2 next_watchdog->delta_interval += the_watchdog->delta_interval; 2009bac: c6 00 60 10 ld [ %g1 + 0x10 ], %g3 2009bb0: c4 07 60 10 ld [ %i5 + 0x10 ], %g2 2009bb4: 84 00 c0 02 add %g3, %g2, %g2 2009bb8: c4 20 60 10 st %g2, [ %g1 + 0x10 ] if ( _Watchdog_Sync_count ) 2009bbc: 05 00 80 72 sethi %hi(0x201c800), %g2 2009bc0: c4 00 a2 10 ld [ %g2 + 0x210 ], %g2 ! 201ca10 <_Watchdog_Sync_count> 2009bc4: 80 a0 a0 00 cmp %g2, 0 2009bc8: 22 80 00 07 be,a 2009be4 <_Watchdog_Remove+0x80> 2009bcc: c4 07 60 04 ld [ %i5 + 4 ], %g2 _Watchdog_Sync_level = _ISR_Nest_level; 2009bd0: 05 00 80 73 sethi %hi(0x201cc00), %g2 2009bd4: c6 00 a2 40 ld [ %g2 + 0x240 ], %g3 ! 201ce40 <_Per_CPU_Information+0x8> 2009bd8: 05 00 80 72 sethi %hi(0x201c800), %g2 2009bdc: c6 20 a1 a8 st %g3, [ %g2 + 0x1a8 ] ! 201c9a8 <_Watchdog_Sync_level> { Chain_Node *next; Chain_Node *previous; next = the_node->next; previous = the_node->previous; 2009be0: c4 07 60 04 ld [ %i5 + 4 ], %g2 next->previous = previous; 2009be4: c4 20 60 04 st %g2, [ %g1 + 4 ] previous->next = next; 2009be8: c2 20 80 00 st %g1, [ %g2 ] _Chain_Extract_unprotected( &the_watchdog->Node ); break; } the_watchdog->stop_time = _Watchdog_Ticks_since_boot; 2009bec: 03 00 80 72 sethi %hi(0x201c800), %g1 2009bf0: c2 00 62 14 ld [ %g1 + 0x214 ], %g1 ! 201ca14 <_Watchdog_Ticks_since_boot> 2009bf4: c2 27 60 18 st %g1, [ %i5 + 0x18 ] _ISR_Enable( level ); 2009bf8: 7f ff e1 49 call 200211c 2009bfc: 01 00 00 00 nop return( previous_state ); } 2009c00: 81 c7 e0 08 ret 2009c04: 81 e8 00 00 restore =============================================================================== 0200acb4 <_Watchdog_Report_chain>: void _Watchdog_Report_chain( const char *name, Chain_Control *header ) { 200acb4: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; Chain_Node *node; _ISR_Disable( level ); 200acb8: 7f ff df 84 call 2002ac8 200acbc: ba 10 00 18 mov %i0, %i5 200acc0: b0 10 00 08 mov %o0, %i0 printk( "Watchdog Chain: %s %p\n", name, header ); 200acc4: 11 00 80 71 sethi %hi(0x201c400), %o0 200acc8: 94 10 00 19 mov %i1, %o2 200accc: 90 12 23 28 or %o0, 0x328, %o0 200acd0: 7f ff e6 28 call 2004570 200acd4: 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; 200acd8: 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 ); 200acdc: b2 06 60 04 add %i1, 4, %i1 if ( !_Chain_Is_empty( header ) ) { 200ace0: 80 a7 00 19 cmp %i4, %i1 200ace4: 12 80 00 04 bne 200acf4 <_Watchdog_Report_chain+0x40> 200ace8: 92 10 00 1c mov %i4, %o1 _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); } else { printk( "Chain is empty\n" ); 200acec: 10 80 00 0d b 200ad20 <_Watchdog_Report_chain+0x6c> 200acf0: 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 ); 200acf4: 40 00 00 0f call 200ad30 <_Watchdog_Report> 200acf8: 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 ) 200acfc: 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 ) ; 200ad00: 80 a7 00 19 cmp %i4, %i1 200ad04: 12 bf ff fc bne 200acf4 <_Watchdog_Report_chain+0x40> <== NEVER TAKEN 200ad08: 92 10 00 1c mov %i4, %o1 { Watchdog_Control *watch = (Watchdog_Control *) node; _Watchdog_Report( NULL, watch ); } printk( "== end of %s \n", name ); 200ad0c: 11 00 80 71 sethi %hi(0x201c400), %o0 200ad10: 92 10 00 1d mov %i5, %o1 200ad14: 7f ff e6 17 call 2004570 200ad18: 90 12 23 40 or %o0, 0x340, %o0 200ad1c: 30 80 00 03 b,a 200ad28 <_Watchdog_Report_chain+0x74> } else { printk( "Chain is empty\n" ); 200ad20: 7f ff e6 14 call 2004570 200ad24: 90 12 23 50 or %o0, 0x350, %o0 } _ISR_Enable( level ); 200ad28: 7f ff df 6c call 2002ad8 200ad2c: 81 e8 00 00 restore =============================================================================== 0200679c : * operation(s) cannot be canceled */ int aio_cancel(int fildes, struct aiocb *aiocbp) { 200679c: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request_chain *r_chain; int result; pthread_mutex_lock (&aio_request_queue.mutex); 20067a0: 3b 00 80 62 sethi %hi(0x2018800), %i5 20067a4: 40 00 04 5d call 2007918 20067a8: 90 17 61 6c or %i5, 0x16c, %o0 ! 201896c if (fcntl (fildes, F_GETFD) < 0) { 20067ac: 90 10 00 18 mov %i0, %o0 20067b0: 40 00 1c 84 call 200d9c0 20067b4: 92 10 20 01 mov 1, %o1 20067b8: 80 a2 20 00 cmp %o0, 0 20067bc: 16 80 00 08 bge 20067dc 20067c0: 80 a6 60 00 cmp %i1, 0 pthread_mutex_unlock(&aio_request_queue.mutex); 20067c4: 40 00 04 75 call 2007998 20067c8: 90 17 61 6c or %i5, 0x16c, %o0 rtems_set_errno_and_return_minus_one (EBADF); 20067cc: 40 00 29 ae call 2010e84 <__errno> 20067d0: 01 00 00 00 nop 20067d4: 10 80 00 4e b 200690c 20067d8: 82 10 20 09 mov 9, %g1 ! 9 } /* if aiocbp is NULL remove all request for given file descriptor */ if (aiocbp == NULL) { 20067dc: 32 80 00 2f bne,a 2006898 20067e0: 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); 20067e4: 11 00 80 62 sethi %hi(0x2018800), %o0 20067e8: 92 10 00 18 mov %i0, %o1 20067ec: 90 12 21 b4 or %o0, 0x1b4, %o0 20067f0: 40 00 00 bb call 2006adc 20067f4: 94 10 20 00 clr %o2 if (r_chain == NULL) { 20067f8: b8 92 20 00 orcc %o0, 0, %i4 20067fc: 32 80 00 1a bne,a 2006864 2006800: 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; 2006804: ba 17 61 6c or %i5, 0x16c, %i5 AIO_printf ("Request chain not on [WQ]\n"); if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 2006808: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 200680c: 82 07 60 58 add %i5, 0x58, %g1 2006810: 80 a0 80 01 cmp %g2, %g1 2006814: 02 80 00 48 be 2006934 <== NEVER TAKEN 2006818: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 200681c: 92 10 00 18 mov %i0, %o1 2006820: 40 00 00 af call 2006adc 2006824: 94 10 20 00 clr %o2 if (r_chain == NULL) { 2006828: b8 92 20 00 orcc %o0, 0, %i4 200682c: 22 80 00 43 be,a 2006938 2006830: 90 10 00 1d mov %i5, %o0 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2006834: 40 00 0a a2 call 20092bc <_Chain_Extract> 2006838: 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); 200683c: 40 00 01 8d call 2006e70 2006840: 90 10 00 1c mov %i4, %o0 pthread_mutex_destroy (&r_chain->mutex); 2006844: 40 00 03 90 call 2007684 2006848: 90 10 00 19 mov %i1, %o0 pthread_cond_destroy (&r_chain->mutex); 200684c: 40 00 02 b5 call 2007320 2006850: 90 10 00 19 mov %i1, %o0 free (r_chain); 2006854: 7f ff f3 31 call 2003518 2006858: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 200685c: 10 80 00 0b b 2006888 2006860: 90 10 00 1d mov %i5, %o0 return AIO_ALLDONE; } AIO_printf ("Request chain on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2006864: 40 00 04 2d call 2007918 2006868: 90 10 00 19 mov %i1, %o0 200686c: 40 00 0a 94 call 20092bc <_Chain_Extract> 2006870: 90 10 00 1c mov %i4, %o0 rtems_chain_extract (&r_chain->next_fd); rtems_aio_remove_fd (r_chain); 2006874: 40 00 01 7f call 2006e70 2006878: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&r_chain->mutex); 200687c: 40 00 04 47 call 2007998 2006880: 90 10 00 19 mov %i1, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2006884: 90 17 61 6c or %i5, 0x16c, %o0 2006888: 40 00 04 44 call 2007998 200688c: b0 10 20 00 clr %i0 return AIO_CANCELED; 2006890: 81 c7 e0 08 ret 2006894: 81 e8 00 00 restore } else { AIO_printf ("Cancel request\n"); if (aiocbp->aio_fildes != fildes) { 2006898: 80 a7 00 18 cmp %i4, %i0 200689c: 12 80 00 17 bne 20068f8 20068a0: 90 17 61 6c or %i5, 0x16c, %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); 20068a4: 11 00 80 62 sethi %hi(0x2018800), %o0 20068a8: 92 10 00 1c mov %i4, %o1 20068ac: 90 12 21 b4 or %o0, 0x1b4, %o0 20068b0: 40 00 00 8b call 2006adc 20068b4: 94 10 20 00 clr %o2 if (r_chain == NULL) { 20068b8: b0 92 20 00 orcc %o0, 0, %i0 20068bc: 32 80 00 23 bne,a 2006948 20068c0: b8 06 20 1c add %i0, 0x1c, %i4 20068c4: ba 17 61 6c or %i5, 0x16c, %i5 if (!rtems_chain_is_empty (&aio_request_queue.idle_req)) { 20068c8: c4 07 60 54 ld [ %i5 + 0x54 ], %g2 20068cc: 82 07 60 58 add %i5, 0x58, %g1 20068d0: 80 a0 80 01 cmp %g2, %g1 20068d4: 02 80 00 18 be 2006934 <== NEVER TAKEN 20068d8: 90 07 60 54 add %i5, 0x54, %o0 r_chain = rtems_aio_search_fd (&aio_request_queue.idle_req, fildes, 0); 20068dc: 92 10 00 1c mov %i4, %o1 20068e0: 40 00 00 7f call 2006adc 20068e4: 94 10 20 00 clr %o2 if (r_chain == NULL) { 20068e8: 80 a2 20 00 cmp %o0, 0 20068ec: 12 80 00 0b bne 2006918 20068f0: 92 10 00 19 mov %i1, %o1 pthread_mutex_unlock (&aio_request_queue.mutex); 20068f4: 90 10 00 1d mov %i5, %o0 20068f8: 40 00 04 28 call 2007998 20068fc: 01 00 00 00 nop rtems_set_errno_and_return_minus_one (EINVAL); 2006900: 40 00 29 61 call 2010e84 <__errno> 2006904: 01 00 00 00 nop 2006908: 82 10 20 16 mov 0x16, %g1 ! 16 200690c: c2 22 00 00 st %g1, [ %o0 ] 2006910: 81 c7 e0 08 ret 2006914: 91 e8 3f ff restore %g0, -1, %o0 } AIO_printf ("Request on [IQ]\n"); result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2006918: 40 00 01 6a call 2006ec0 200691c: 90 02 20 08 add %o0, 8, %o0 2006920: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&aio_request_queue.mutex); 2006924: 40 00 04 1d call 2007998 2006928: 90 10 00 1d mov %i5, %o0 return result; 200692c: 81 c7 e0 08 ret 2006930: 81 e8 00 00 restore } else { pthread_mutex_unlock (&aio_request_queue.mutex); 2006934: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2006938: 40 00 04 18 call 2007998 200693c: b0 10 20 02 mov 2, %i0 return AIO_ALLDONE; 2006940: 81 c7 e0 08 ret 2006944: 81 e8 00 00 restore } } AIO_printf ("Request on [WQ]\n"); pthread_mutex_lock (&r_chain->mutex); 2006948: 40 00 03 f4 call 2007918 200694c: 90 10 00 1c mov %i4, %o0 result = rtems_aio_remove_req (&r_chain->perfd, aiocbp); 2006950: 92 10 00 19 mov %i1, %o1 2006954: 40 00 01 5b call 2006ec0 2006958: 90 06 20 08 add %i0, 8, %o0 200695c: b0 10 00 08 mov %o0, %i0 pthread_mutex_unlock (&r_chain->mutex); 2006960: 40 00 04 0e call 2007998 2006964: 90 10 00 1c mov %i4, %o0 pthread_mutex_unlock (&aio_request_queue.mutex); 2006968: 40 00 04 0c call 2007998 200696c: 90 17 61 6c or %i5, 0x16c, %o0 return result; } return AIO_ALLDONE; } 2006970: 81 c7 e0 08 ret 2006974: 81 e8 00 00 restore =============================================================================== 02006980 : int aio_fsync( int op, struct aiocb *aiocbp ) { 2006980: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; if (op != O_SYNC) 2006984: 03 00 00 08 sethi %hi(0x2000), %g1 2006988: 80 a6 00 01 cmp %i0, %g1 200698c: 12 80 00 10 bne 20069cc 2006990: ba 10 20 16 mov 0x16, %i5 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2006994: d0 06 40 00 ld [ %i1 ], %o0 2006998: 40 00 1c 0a call 200d9c0 200699c: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_WRONLY) || ((mode & O_ACCMODE) == O_RDWR))) 20069a0: 90 0a 20 03 and %o0, 3, %o0 20069a4: 90 02 3f ff add %o0, -1, %o0 20069a8: 80 a2 20 01 cmp %o0, 1 20069ac: 18 80 00 08 bgu 20069cc 20069b0: ba 10 20 09 mov 9, %i5 rtems_aio_set_errno_return_minus_one (EBADF, aiocbp); req = malloc (sizeof (rtems_aio_request)); 20069b4: 7f ff f4 51 call 2003af8 20069b8: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 20069bc: 80 a2 20 00 cmp %o0, 0 20069c0: 32 80 00 0b bne,a 20069ec <== ALWAYS TAKEN 20069c4: f2 22 20 14 st %i1, [ %o0 + 0x14 ] rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 20069c8: ba 10 20 0b mov 0xb, %i5 <== NOT EXECUTED 20069cc: 82 10 3f ff mov -1, %g1 20069d0: fa 26 60 34 st %i5, [ %i1 + 0x34 ] 20069d4: c2 26 60 38 st %g1, [ %i1 + 0x38 ] 20069d8: 40 00 29 2b call 2010e84 <__errno> 20069dc: b0 10 3f ff mov -1, %i0 20069e0: fa 22 00 00 st %i5, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_SYNC; return rtems_aio_enqueue (req); } 20069e4: 81 c7 e0 08 ret 20069e8: 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; 20069ec: 82 10 20 03 mov 3, %g1 20069f0: c2 26 60 30 st %g1, [ %i1 + 0x30 ] return rtems_aio_enqueue (req); 20069f4: 40 00 01 50 call 2006f34 20069f8: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02007164 : * 0 - otherwise */ int aio_read (struct aiocb *aiocbp) { 2007164: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2007168: d0 06 00 00 ld [ %i0 ], %o0 200716c: 40 00 1a 15 call 200d9c0 2007170: 92 10 20 03 mov 3, %o1 if (!(((mode & O_ACCMODE) == O_RDONLY) || ((mode & O_ACCMODE) == O_RDWR))) 2007174: 90 0a 20 03 and %o0, 3, %o0 2007178: 80 a2 20 02 cmp %o0, 2 200717c: 02 80 00 05 be 2007190 2007180: ba 10 00 18 mov %i0, %i5 2007184: 80 a2 20 00 cmp %o0, 0 2007188: 12 80 00 10 bne 20071c8 <== ALWAYS TAKEN 200718c: 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) 2007190: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 2007194: 80 a0 60 00 cmp %g1, 0 2007198: 32 80 00 0c bne,a 20071c8 200719c: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 20071a0: c2 07 60 08 ld [ %i5 + 8 ], %g1 20071a4: 80 a0 60 00 cmp %g1, 0 20071a8: 26 80 00 08 bl,a 20071c8 20071ac: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 20071b0: 7f ff f2 52 call 2003af8 20071b4: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 20071b8: 80 a2 20 00 cmp %o0, 0 20071bc: 32 80 00 0b bne,a 20071e8 <== ALWAYS TAKEN 20071c0: fa 22 20 14 st %i5, [ %o0 + 0x14 ] 20071c4: b8 10 20 0b mov 0xb, %i4 <== NOT EXECUTED rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 20071c8: 82 10 3f ff mov -1, %g1 20071cc: f8 27 60 34 st %i4, [ %i5 + 0x34 ] 20071d0: c2 27 60 38 st %g1, [ %i5 + 0x38 ] 20071d4: 40 00 27 2c call 2010e84 <__errno> 20071d8: b0 10 3f ff mov -1, %i0 20071dc: f8 22 00 00 st %i4, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_READ; return rtems_aio_enqueue (req); } 20071e0: 81 c7 e0 08 ret 20071e4: 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; 20071e8: 82 10 20 01 mov 1, %g1 20071ec: c2 27 60 30 st %g1, [ %i5 + 0x30 ] return rtems_aio_enqueue (req); 20071f0: 7f ff ff 51 call 2006f34 20071f4: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02007200 : * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 2007200: 9d e3 bf a0 save %sp, -96, %sp rtems_aio_request *req; int mode; mode = fcntl (aiocbp->aio_fildes, F_GETFL); 2007204: d0 06 00 00 ld [ %i0 ], %o0 2007208: 40 00 19 ee call 200d9c0 200720c: 92 10 20 03 mov 3, %o1 * 0 - otherwise */ int aio_write (struct aiocb *aiocbp) { 2007210: 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))) 2007214: 90 0a 20 03 and %o0, 3, %o0 2007218: 90 02 3f ff add %o0, -1, %o0 200721c: 80 a2 20 01 cmp %o0, 1 2007220: 18 80 00 10 bgu 2007260 2007224: 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) 2007228: c2 06 20 18 ld [ %i0 + 0x18 ], %g1 200722c: 80 a0 60 00 cmp %g1, 0 2007230: 32 80 00 0c bne,a 2007260 2007234: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); if (aiocbp->aio_offset < 0) 2007238: c2 06 20 08 ld [ %i0 + 8 ], %g1 200723c: 80 a0 60 00 cmp %g1, 0 2007240: 26 80 00 08 bl,a 2007260 2007244: b8 10 20 16 mov 0x16, %i4 rtems_aio_set_errno_return_minus_one (EINVAL, aiocbp); req = malloc (sizeof (rtems_aio_request)); 2007248: 7f ff f2 2c call 2003af8 200724c: 90 10 20 18 mov 0x18, %o0 if (req == NULL) 2007250: 80 a2 20 00 cmp %o0, 0 2007254: 32 80 00 0b bne,a 2007280 <== ALWAYS TAKEN 2007258: f0 22 20 14 st %i0, [ %o0 + 0x14 ] 200725c: b8 10 20 0b mov 0xb, %i4 <== NOT EXECUTED rtems_aio_set_errno_return_minus_one (EAGAIN, aiocbp); 2007260: 82 10 3f ff mov -1, %g1 2007264: f8 27 60 34 st %i4, [ %i5 + 0x34 ] 2007268: c2 27 60 38 st %g1, [ %i5 + 0x38 ] 200726c: 40 00 27 06 call 2010e84 <__errno> 2007270: b0 10 3f ff mov -1, %i0 2007274: f8 22 00 00 st %i4, [ %o0 ] req->aiocbp = aiocbp; req->aiocbp->aio_lio_opcode = LIO_WRITE; return rtems_aio_enqueue (req); } 2007278: 81 c7 e0 08 ret 200727c: 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; 2007280: 82 10 20 02 mov 2, %g1 2007284: c2 26 20 30 st %g1, [ %i0 + 0x30 ] return rtems_aio_enqueue (req); 2007288: 7f ff ff 2b call 2006f34 200728c: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02005ddc : int clock_gettime( clockid_t clock_id, struct timespec *tp ) { 2005ddc: 9d e3 bf a0 save %sp, -96, %sp if ( !tp ) 2005de0: 90 96 60 00 orcc %i1, 0, %o0 2005de4: 12 80 00 06 bne 2005dfc 2005de8: 80 a6 20 01 cmp %i0, 1 rtems_set_errno_and_return_minus_one( EINVAL ); 2005dec: 40 00 25 fc call 200f5dc <__errno> 2005df0: 01 00 00 00 nop 2005df4: 10 80 00 15 b 2005e48 2005df8: 82 10 20 16 mov 0x16, %g1 ! 16 if ( clock_id == CLOCK_REALTIME ) { 2005dfc: 12 80 00 05 bne 2005e10 2005e00: 80 a6 20 04 cmp %i0, 4 _TOD_Get(tp); 2005e04: 40 00 07 c4 call 2007d14 <_TOD_Get> 2005e08: b0 10 20 00 clr %i0 2005e0c: 30 80 00 16 b,a 2005e64 return 0; } #ifdef CLOCK_MONOTONIC if ( clock_id == CLOCK_MONOTONIC ) { 2005e10: 02 80 00 05 be 2005e24 <== NEVER TAKEN 2005e14: 01 00 00 00 nop return 0; } #endif #ifdef _POSIX_CPUTIME if ( clock_id == CLOCK_PROCESS_CPUTIME ) { 2005e18: 80 a6 20 02 cmp %i0, 2 2005e1c: 12 80 00 06 bne 2005e34 2005e20: 80 a6 20 03 cmp %i0, 3 _TOD_Get_uptime_as_timespec( tp ); 2005e24: 40 00 07 d8 call 2007d84 <_TOD_Get_uptime_as_timespec> 2005e28: b0 10 20 00 clr %i0 return 0; 2005e2c: 81 c7 e0 08 ret 2005e30: 81 e8 00 00 restore } #endif #ifdef _POSIX_THREAD_CPUTIME if ( clock_id == CLOCK_THREAD_CPUTIME ) 2005e34: 12 80 00 08 bne 2005e54 2005e38: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); 2005e3c: 40 00 25 e8 call 200f5dc <__errno> 2005e40: 01 00 00 00 nop 2005e44: 82 10 20 58 mov 0x58, %g1 ! 58 2005e48: c2 22 00 00 st %g1, [ %o0 ] 2005e4c: 81 c7 e0 08 ret 2005e50: 91 e8 3f ff restore %g0, -1, %o0 #endif rtems_set_errno_and_return_minus_one( EINVAL ); 2005e54: 40 00 25 e2 call 200f5dc <__errno> 2005e58: b0 10 3f ff mov -1, %i0 2005e5c: 82 10 20 16 mov 0x16, %g1 2005e60: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2005e64: 81 c7 e0 08 ret 2005e68: 81 e8 00 00 restore =============================================================================== 02005e6c : int clock_settime( clockid_t clock_id, const struct timespec *tp ) { 2005e6c: 9d e3 bf a0 save %sp, -96, %sp if ( !tp ) 2005e70: 90 96 60 00 orcc %i1, 0, %o0 2005e74: 02 80 00 0b be 2005ea0 <== NEVER TAKEN 2005e78: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); if ( clock_id == CLOCK_REALTIME ) { 2005e7c: 80 a6 20 01 cmp %i0, 1 2005e80: 12 80 00 16 bne 2005ed8 2005e84: 80 a6 20 02 cmp %i0, 2 if ( tp->tv_sec < TOD_SECONDS_1970_THROUGH_1988 ) 2005e88: c4 02 00 00 ld [ %o0 ], %g2 2005e8c: 03 08 76 b9 sethi %hi(0x21dae400), %g1 2005e90: 82 10 60 ff or %g1, 0xff, %g1 ! 21dae4ff 2005e94: 80 a0 80 01 cmp %g2, %g1 2005e98: 38 80 00 06 bgu,a 2005eb0 2005e9c: 03 00 80 78 sethi %hi(0x201e000), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 2005ea0: 40 00 25 cf call 200f5dc <__errno> 2005ea4: 01 00 00 00 nop 2005ea8: 10 80 00 14 b 2005ef8 2005eac: 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++; 2005eb0: c4 00 63 40 ld [ %g1 + 0x340 ], %g2 2005eb4: 84 00 a0 01 inc %g2 2005eb8: c4 20 63 40 st %g2, [ %g1 + 0x340 ] return _Thread_Dispatch_disable_level; 2005ebc: c2 00 63 40 ld [ %g1 + 0x340 ], %g1 _Thread_Disable_dispatch(); _TOD_Set( tp ); 2005ec0: 40 00 07 c7 call 2007ddc <_TOD_Set> 2005ec4: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 2005ec8: 40 00 0d ca call 20095f0 <_Thread_Enable_dispatch> 2005ecc: 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; 2005ed0: 81 c7 e0 08 ret 2005ed4: 81 e8 00 00 restore _Thread_Disable_dispatch(); _TOD_Set( tp ); _Thread_Enable_dispatch(); } #ifdef _POSIX_CPUTIME else if ( clock_id == CLOCK_PROCESS_CPUTIME ) 2005ed8: 02 80 00 05 be 2005eec 2005edc: 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 ) 2005ee0: 80 a6 20 03 cmp %i0, 3 2005ee4: 12 80 00 08 bne 2005f04 2005ee8: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( ENOSYS ); 2005eec: 40 00 25 bc call 200f5dc <__errno> 2005ef0: 01 00 00 00 nop 2005ef4: 82 10 20 58 mov 0x58, %g1 ! 58 2005ef8: c2 22 00 00 st %g1, [ %o0 ] 2005efc: 81 c7 e0 08 ret 2005f00: 91 e8 3f ff restore %g0, -1, %o0 #endif else rtems_set_errno_and_return_minus_one( EINVAL ); 2005f04: 40 00 25 b6 call 200f5dc <__errno> 2005f08: b0 10 3f ff mov -1, %i0 2005f0c: 82 10 20 16 mov 0x16, %g1 2005f10: c2 22 00 00 st %g1, [ %o0 ] return 0; } 2005f14: 81 c7 e0 08 ret 2005f18: 81 e8 00 00 restore =============================================================================== 020193ac : int killinfo( pid_t pid, int sig, const union sigval *value ) { 20193ac: 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() ) 20193b0: 7f ff fe f2 call 2018f78 20193b4: 01 00 00 00 nop 20193b8: 80 a6 00 08 cmp %i0, %o0 20193bc: 02 80 00 06 be 20193d4 20193c0: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); 20193c4: 7f ff d5 64 call 200e954 <__errno> 20193c8: 01 00 00 00 nop 20193cc: 10 80 00 a5 b 2019660 20193d0: 82 10 20 03 mov 3, %g1 ! 3 /* * Validate the signal passed. */ if ( !sig ) 20193d4: 02 80 00 06 be 20193ec 20193d8: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 20193dc: ba 06 7f ff add %i1, -1, %i5 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 20193e0: 80 a7 60 1f cmp %i5, 0x1f 20193e4: 28 80 00 06 bleu,a 20193fc 20193e8: 83 2e 60 02 sll %i1, 2, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 20193ec: 7f ff d5 5a call 200e954 <__errno> 20193f0: 01 00 00 00 nop 20193f4: 10 80 00 9b b 2019660 20193f8: 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 ) 20193fc: 85 2e 60 04 sll %i1, 4, %g2 2019400: 84 20 80 01 sub %g2, %g1, %g2 2019404: 03 00 80 73 sethi %hi(0x201cc00), %g1 2019408: 82 10 62 90 or %g1, 0x290, %g1 ! 201ce90 <_POSIX_signals_Vectors> 201940c: 82 00 40 02 add %g1, %g2, %g1 2019410: c2 00 60 08 ld [ %g1 + 8 ], %g1 2019414: 80 a0 60 01 cmp %g1, 1 2019418: 02 80 00 7b be 2019604 201941c: 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 ) ) 2019420: 80 a6 60 04 cmp %i1, 4 2019424: 02 80 00 06 be 201943c 2019428: 80 a6 60 08 cmp %i1, 8 201942c: 02 80 00 04 be 201943c 2019430: 80 a6 60 0b cmp %i1, 0xb 2019434: 12 80 00 08 bne 2019454 2019438: 82 10 20 01 mov 1, %g1 return pthread_kill( pthread_self(), sig ); 201943c: 40 00 01 2e call 20198f4 2019440: 01 00 00 00 nop 2019444: 40 00 00 f2 call 201980c 2019448: 92 10 00 19 mov %i1, %o1 201944c: 81 c7 e0 08 ret 2019450: 91 e8 00 08 restore %g0, %o0, %o0 /* * Build up a siginfo structure */ siginfo = &siginfo_struct; siginfo->si_signo = sig; 2019454: f2 27 bf f4 st %i1, [ %fp + -12 ] siginfo->si_code = SI_USER; 2019458: c2 27 bf f8 st %g1, [ %fp + -8 ] if ( !value ) { 201945c: 80 a6 a0 00 cmp %i2, 0 2019460: 12 80 00 04 bne 2019470 2019464: bb 28 40 1d sll %g1, %i5, %i5 siginfo->si_value.sival_int = 0; 2019468: 10 80 00 04 b 2019478 201946c: c0 27 bf fc clr [ %fp + -4 ] } else { siginfo->si_value = *value; 2019470: c2 06 80 00 ld [ %i2 ], %g1 2019474: 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++; 2019478: 03 00 80 72 sethi %hi(0x201c800), %g1 201947c: c4 00 61 00 ld [ %g1 + 0x100 ], %g2 ! 201c900 <_Thread_Dispatch_disable_level> 2019480: 84 00 a0 01 inc %g2 2019484: c4 20 61 00 st %g2, [ %g1 + 0x100 ] return _Thread_Dispatch_disable_level; 2019488: c2 00 61 00 ld [ %g1 + 0x100 ], %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; 201948c: 03 00 80 73 sethi %hi(0x201cc00), %g1 2019490: d0 00 62 44 ld [ %g1 + 0x244 ], %o0 ! 201ce44 <_Per_CPU_Information+0xc> api = the_thread->API_Extensions[ THREAD_API_POSIX ]; if ( _POSIX_signals_Is_interested( api, mask ) ) { 2019494: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 2019498: c2 00 60 d0 ld [ %g1 + 0xd0 ], %g1 201949c: 80 af 40 01 andncc %i5, %g1, %g0 20194a0: 12 80 00 51 bne 20195e4 20194a4: 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; 20194a8: d0 00 60 1c ld [ %g1 + 0x1c ], %o0 ! 201d01c <_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 ); 20194ac: 03 00 80 74 sethi %hi(0x201d000), %g1 20194b0: 10 80 00 0a b 20194d8 20194b4: 82 10 60 20 or %g1, 0x20, %g1 ! 201d020 <_POSIX_signals_Wait_queue+0x4> #endif /* * Is this thread is actually blocked waiting for the signal? */ if (the_thread->Wait.option & mask) 20194b8: 80 8f 40 03 btst %i5, %g3 20194bc: 12 80 00 4a bne 20195e4 20194c0: 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) 20194c4: c4 00 a0 d0 ld [ %g2 + 0xd0 ], %g2 20194c8: 80 af 40 02 andncc %i5, %g2, %g0 20194cc: 12 80 00 47 bne 20195e8 20194d0: 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 ) { 20194d4: 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 ); 20194d8: 80 a2 00 01 cmp %o0, %g1 20194dc: 32 bf ff f7 bne,a 20194b8 20194e0: c6 02 20 30 ld [ %o0 + 0x30 ], %g3 * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; interested_priority = PRIORITY_MAXIMUM + 1; 20194e4: 03 00 80 6e sethi %hi(0x201b800), %g1 20194e8: c4 08 63 dc ldub [ %g1 + 0x3dc ], %g2 ! 201bbdc * * NOTES: * * + rtems internal threads do not receive signals. */ interested = NULL; 20194ec: 90 10 20 00 clr %o0 interested_priority = PRIORITY_MAXIMUM + 1; 20194f0: 84 00 a0 01 inc %g2 for (the_api = OBJECTS_CLASSIC_API; the_api <= OBJECTS_APIS_LAST; the_api++) { 20194f4: 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 ] ) 20194f8: 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); 20194fc: 31 04 00 00 sethi %hi(0x10000000), %i0 */ #define _POSIX_signals_Is_interested( _api, _mask ) \ ( ~(_api)->signals_blocked & (_mask) ) int killinfo( 2019500: 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 ] ) 2019504: 86 13 20 68 or %o4, 0x68, %g3 2019508: c2 00 c0 01 ld [ %g3 + %g1 ], %g1 201950c: 80 a0 60 00 cmp %g1, 0 2019510: 22 80 00 2f be,a 20195cc <== NEVER TAKEN 2019514: 88 01 20 01 inc %g4 <== NOT EXECUTED continue; the_info = _Objects_Information_table[ the_api ][ 1 ]; 2019518: 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++ ) { 201951c: b4 10 20 01 mov 1, %i2 */ if ( !the_info ) continue; #endif maximum = the_info->maximum; 2019520: d4 10 60 10 lduh [ %g1 + 0x10 ], %o2 object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 2019524: 10 80 00 26 b 20195bc 2019528: d6 00 60 1c ld [ %g1 + 0x1c ], %o3 the_thread = (Thread_Control *) object_table[ index ]; 201952c: c2 02 c0 01 ld [ %o3 + %g1 ], %g1 if ( !the_thread ) 2019530: 80 a0 60 00 cmp %g1, 0 2019534: 22 80 00 22 be,a 20195bc 2019538: 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 ) 201953c: c6 00 60 14 ld [ %g1 + 0x14 ], %g3 2019540: 80 a0 c0 02 cmp %g3, %g2 2019544: 38 80 00 1e bgu,a 20195bc 2019548: b4 06 a0 01 inc %i2 #if defined(RTEMS_DEBUG) if ( !api ) continue; #endif if ( !_POSIX_signals_Is_interested( api, mask ) ) 201954c: de 00 61 5c ld [ %g1 + 0x15c ], %o7 2019550: de 03 e0 d0 ld [ %o7 + 0xd0 ], %o7 2019554: 80 af 40 0f andncc %i5, %o7, %g0 2019558: 22 80 00 19 be,a 20195bc 201955c: 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 ) { 2019560: 80 a0 c0 02 cmp %g3, %g2 2019564: 2a 80 00 14 bcs,a 20195b4 2019568: 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 ) ) { 201956c: 80 a2 20 00 cmp %o0, 0 2019570: 22 80 00 13 be,a 20195bc <== NEVER TAKEN 2019574: b4 06 a0 01 inc %i2 <== NOT EXECUTED 2019578: da 02 20 10 ld [ %o0 + 0x10 ], %o5 201957c: 80 a3 60 00 cmp %o5, 0 2019580: 22 80 00 0f be,a 20195bc <== NEVER TAKEN 2019584: b4 06 a0 01 inc %i2 <== NOT EXECUTED /* preferred ready over blocked */ DEBUG_STEP("5"); if ( _States_Is_ready( the_thread->current_state ) ) { 2019588: de 00 60 10 ld [ %g1 + 0x10 ], %o7 201958c: 80 a3 e0 00 cmp %o7, 0 2019590: 22 80 00 09 be,a 20195b4 2019594: 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) ) { 2019598: 80 8b 40 18 btst %o5, %i0 201959c: 32 80 00 08 bne,a 20195bc 20195a0: b4 06 a0 01 inc %i2 DEBUG_STEP("7"); if ( _States_Is_interruptible_by_signal(the_thread->current_state) ) { 20195a4: 80 8b c0 18 btst %o7, %i0 20195a8: 22 80 00 05 be,a 20195bc 20195ac: 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 ) ) { 20195b0: 84 10 00 03 mov %g3, %g2 20195b4: 90 10 00 01 mov %g1, %o0 #endif maximum = the_info->maximum; object_table = the_info->local_table; for ( index = 1 ; index <= maximum ; index++ ) { 20195b8: b4 06 a0 01 inc %i2 20195bc: 80 a6 80 0a cmp %i2, %o2 20195c0: 08 bf ff db bleu 201952c 20195c4: 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++) { 20195c8: 88 01 20 01 inc %g4 20195cc: 80 a1 20 04 cmp %g4, 4 20195d0: 12 bf ff cd bne 2019504 20195d4: 83 29 20 02 sll %g4, 2, %g1 } } } } if ( interested ) { 20195d8: 80 a2 20 00 cmp %o0, 0 20195dc: 02 80 00 0c be 201960c 20195e0: 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 ) ) { 20195e4: 92 10 00 19 mov %i1, %o1 20195e8: 40 00 00 36 call 20196c0 <_POSIX_signals_Unblock_thread> 20195ec: 94 07 bf f4 add %fp, -12, %o2 20195f0: 80 8a 20 ff btst 0xff, %o0 20195f4: 02 80 00 06 be 201960c 20195f8: 01 00 00 00 nop _Thread_Enable_dispatch(); 20195fc: 7f ff bd 5f call 2008b78 <_Thread_Enable_dispatch> 2019600: b0 10 20 00 clr %i0 ! 0 return 0; 2019604: 81 c7 e0 08 ret 2019608: 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 ); 201960c: 40 00 00 24 call 201969c <_POSIX_signals_Set_process_signals> 2019610: 90 10 00 1d mov %i5, %o0 if ( _POSIX_signals_Vectors[ sig ].sa_flags == SA_SIGINFO ) { 2019614: 83 2e 60 02 sll %i1, 2, %g1 2019618: b3 2e 60 04 sll %i1, 4, %i1 201961c: b2 26 40 01 sub %i1, %g1, %i1 2019620: 03 00 80 73 sethi %hi(0x201cc00), %g1 2019624: 82 10 62 90 or %g1, 0x290, %g1 ! 201ce90 <_POSIX_signals_Vectors> 2019628: c2 00 40 19 ld [ %g1 + %i1 ], %g1 201962c: 80 a0 60 02 cmp %g1, 2 2019630: 12 80 00 17 bne 201968c 2019634: 11 00 80 74 sethi %hi(0x201d000), %o0 psiginfo = (POSIX_signals_Siginfo_node *) 2019638: 7f ff b6 18 call 2006e98 <_Chain_Get> 201963c: 90 12 20 10 or %o0, 0x10, %o0 ! 201d010 <_POSIX_signals_Inactive_siginfo> _Chain_Get( &_POSIX_signals_Inactive_siginfo ); if ( !psiginfo ) { 2019640: ba 92 20 00 orcc %o0, 0, %i5 2019644: 12 80 00 0a bne 201966c 2019648: 92 07 bf f4 add %fp, -12, %o1 _Thread_Enable_dispatch(); 201964c: 7f ff bd 4b call 2008b78 <_Thread_Enable_dispatch> 2019650: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EAGAIN ); 2019654: 7f ff d4 c0 call 200e954 <__errno> 2019658: 01 00 00 00 nop 201965c: 82 10 20 0b mov 0xb, %g1 ! b 2019660: c2 22 00 00 st %g1, [ %o0 ] 2019664: 81 c7 e0 08 ret 2019668: 91 e8 3f ff restore %g0, -1, %o0 } psiginfo->Info = *siginfo; 201966c: 90 07 60 08 add %i5, 8, %o0 2019670: 7f ff d7 0e call 200f2a8 2019674: 94 10 20 0c mov 0xc, %o2 _Chain_Append( &_POSIX_signals_Siginfo[ sig ], &psiginfo->Node ); 2019678: 11 00 80 74 sethi %hi(0x201d000), %o0 201967c: 92 10 00 1d mov %i5, %o1 2019680: 90 12 20 88 or %o0, 0x88, %o0 2019684: 7f ff b5 f1 call 2006e48 <_Chain_Append> 2019688: 90 02 00 19 add %o0, %i1, %o0 } DEBUG_STEP("\n"); _Thread_Enable_dispatch(); 201968c: 7f ff bd 3b call 2008b78 <_Thread_Enable_dispatch> 2019690: b0 10 20 00 clr %i0 return 0; } 2019694: 81 c7 e0 08 ret 2019698: 81 e8 00 00 restore =============================================================================== 0200b554 : int pthread_attr_setschedpolicy( pthread_attr_t *attr, int policy ) { 200b554: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 200b558: 80 a0 60 00 cmp %g1, 0 200b55c: 02 80 00 0f be 200b598 200b560: 90 10 20 16 mov 0x16, %o0 200b564: c4 00 40 00 ld [ %g1 ], %g2 200b568: 80 a0 a0 00 cmp %g2, 0 200b56c: 02 80 00 0b be 200b598 200b570: 80 a2 60 04 cmp %o1, 4 return EINVAL; switch ( policy ) { 200b574: 18 80 00 09 bgu 200b598 200b578: 90 10 20 86 mov 0x86, %o0 200b57c: 84 10 20 01 mov 1, %g2 200b580: 85 28 80 09 sll %g2, %o1, %g2 200b584: 80 88 a0 17 btst 0x17, %g2 200b588: 02 80 00 04 be 200b598 <== NEVER TAKEN 200b58c: 01 00 00 00 nop case SCHED_OTHER: case SCHED_FIFO: case SCHED_RR: case SCHED_SPORADIC: attr->schedpolicy = policy; 200b590: d2 20 60 14 st %o1, [ %g1 + 0x14 ] 200b594: 90 10 20 00 clr %o0 return 0; default: return ENOTSUP; } } 200b598: 81 c3 e0 08 retl =============================================================================== 020063b8 : int pthread_barrier_init( pthread_barrier_t *barrier, const pthread_barrierattr_t *attr, unsigned int count ) { 20063b8: 9d e3 bf 90 save %sp, -112, %sp 20063bc: ba 10 00 18 mov %i0, %i5 const pthread_barrierattr_t *the_attr; /* * Error check parameters */ if ( !barrier ) 20063c0: 80 a7 60 00 cmp %i5, 0 20063c4: 02 80 00 20 be 2006444 20063c8: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( count == 0 ) 20063cc: 80 a6 a0 00 cmp %i2, 0 20063d0: 02 80 00 1d be 2006444 20063d4: 80 a6 60 00 cmp %i1, 0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 20063d8: 32 80 00 06 bne,a 20063f0 20063dc: c2 06 40 00 ld [ %i1 ], %g1 the_attr = attr; } else { (void) pthread_barrierattr_init( &my_attr ); 20063e0: 90 07 bf f8 add %fp, -8, %o0 20063e4: 7f ff ff bd call 20062d8 20063e8: 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 ) 20063ec: c2 06 40 00 ld [ %i1 ], %g1 20063f0: 80 a0 60 00 cmp %g1, 0 20063f4: 02 80 00 14 be 2006444 20063f8: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 20063fc: c2 06 60 04 ld [ %i1 + 4 ], %g1 2006400: 80 a0 60 00 cmp %g1, 0 2006404: 12 80 00 10 bne 2006444 <== NEVER TAKEN 2006408: 03 00 80 5c sethi %hi(0x2017000), %g1 /** * This rountine increments the thread dispatch level */ RTEMS_INLINE_ROUTINE uint32_t _Thread_Dispatch_increment_disable_level(void) { _Thread_Dispatch_disable_level++; 200640c: c4 00 63 e0 ld [ %g1 + 0x3e0 ], %g2 ! 20173e0 <_Thread_Dispatch_disable_level> } /* * Convert from POSIX attributes to Core Barrier attributes */ the_attributes.discipline = CORE_BARRIER_AUTOMATIC_RELEASE; 2006410: c0 27 bf f0 clr [ %fp + -16 ] the_attributes.maximum_count = count; 2006414: f4 27 bf f4 st %i2, [ %fp + -12 ] 2006418: 84 00 a0 01 inc %g2 200641c: c4 20 63 e0 st %g2, [ %g1 + 0x3e0 ] return _Thread_Dispatch_disable_level; 2006420: c2 00 63 e0 ld [ %g1 + 0x3e0 ], %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 *) 2006424: 37 00 80 5d sethi %hi(0x2017400), %i3 2006428: 40 00 08 57 call 2008584 <_Objects_Allocate> 200642c: 90 16 e3 a0 or %i3, 0x3a0, %o0 ! 20177a0 <_POSIX_Barrier_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_barrier = _POSIX_Barrier_Allocate(); if ( !the_barrier ) { 2006430: b8 92 20 00 orcc %o0, 0, %i4 2006434: 12 80 00 06 bne 200644c 2006438: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); 200643c: 40 00 0c ed call 20097f0 <_Thread_Enable_dispatch> 2006440: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2006444: 81 c7 e0 08 ret 2006448: 81 e8 00 00 restore } _CORE_barrier_Initialize( &the_barrier->Barrier, &the_attributes ); 200644c: 40 00 05 be call 2007b44 <_CORE_barrier_Initialize> 2006450: 92 07 bf f0 add %fp, -16, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006454: 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; } 2006458: b6 16 e3 a0 or %i3, 0x3a0, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200645c: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006460: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006464: 85 28 a0 02 sll %g2, 2, %g2 2006468: 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; 200646c: c0 27 20 0c clr [ %i4 + 0xc ] ); /* * Exit the critical section and return the user an operational barrier */ *barrier = the_barrier->Object.id; 2006470: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2006474: 40 00 0c df call 20097f0 <_Thread_Enable_dispatch> 2006478: b0 10 20 00 clr %i0 return 0; } 200647c: 81 c7 e0 08 ret 2006480: 81 e8 00 00 restore =============================================================================== 02005c2c : void pthread_cleanup_push( void (*routine)( void * ), void *arg ) { 2005c2c: 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 ) 2005c30: 80 a6 20 00 cmp %i0, 0 2005c34: 02 80 00 15 be 2005c88 2005c38: 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++; 2005c3c: 03 00 80 5e sethi %hi(0x2017800), %g1 2005c40: c4 00 60 40 ld [ %g1 + 0x40 ], %g2 ! 2017840 <_Thread_Dispatch_disable_level> 2005c44: 84 00 a0 01 inc %g2 2005c48: c4 20 60 40 st %g2, [ %g1 + 0x40 ] return _Thread_Dispatch_disable_level; 2005c4c: c2 00 60 40 ld [ %g1 + 0x40 ], %g1 return; _Thread_Disable_dispatch(); handler = _Workspace_Allocate( sizeof( POSIX_Cancel_Handler_control ) ); 2005c50: 40 00 11 b5 call 200a324 <_Workspace_Allocate> 2005c54: 90 10 20 10 mov 0x10, %o0 if ( handler ) { 2005c58: 92 92 20 00 orcc %o0, 0, %o1 2005c5c: 02 80 00 09 be 2005c80 <== NEVER TAKEN 2005c60: 01 00 00 00 nop thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 2005c64: 03 00 80 5f sethi %hi(0x2017c00), %g1 2005c68: c2 00 61 84 ld [ %g1 + 0x184 ], %g1 ! 2017d84 <_Per_CPU_Information+0xc> handler_stack = &thread_support->Cancellation_Handlers; 2005c6c: d0 00 61 5c ld [ %g1 + 0x15c ], %o0 handler->routine = routine; 2005c70: f0 22 60 08 st %i0, [ %o1 + 8 ] handler->arg = arg; 2005c74: f2 22 60 0c st %i1, [ %o1 + 0xc ] _Chain_Append( handler_stack, &handler->Node ); 2005c78: 40 00 05 f9 call 200745c <_Chain_Append> 2005c7c: 90 02 20 e4 add %o0, 0xe4, %o0 } _Thread_Enable_dispatch(); 2005c80: 40 00 0d 18 call 20090e0 <_Thread_Enable_dispatch> 2005c84: 81 e8 00 00 restore 2005c88: 81 c7 e0 08 ret 2005c8c: 81 e8 00 00 restore =============================================================================== 02006c08 : int pthread_cond_init( pthread_cond_t *cond, const pthread_condattr_t *attr ) { 2006c08: 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; 2006c0c: 80 a6 60 00 cmp %i1, 0 2006c10: 12 80 00 04 bne 2006c20 2006c14: ba 10 00 18 mov %i0, %i5 else the_attr = &_POSIX_Condition_variables_Default_attributes; 2006c18: 33 00 80 5b sethi %hi(0x2016c00), %i1 2006c1c: b2 16 60 dc or %i1, 0xdc, %i1 ! 2016cdc <_POSIX_Condition_variables_Default_attributes> /* * Be careful about attributes when global!!! */ if ( the_attr->process_shared == PTHREAD_PROCESS_SHARED ) 2006c20: c2 06 60 04 ld [ %i1 + 4 ], %g1 2006c24: 80 a0 60 01 cmp %g1, 1 2006c28: 02 80 00 12 be 2006c70 <== NEVER TAKEN 2006c2c: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !the_attr->is_initialized ) 2006c30: c2 06 40 00 ld [ %i1 ], %g1 2006c34: 80 a0 60 00 cmp %g1, 0 2006c38: 02 80 00 0e be 2006c70 2006c3c: 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++; 2006c40: c4 00 61 10 ld [ %g1 + 0x110 ], %g2 ! 2018510 <_Thread_Dispatch_disable_level> 2006c44: 84 00 a0 01 inc %g2 2006c48: c4 20 61 10 st %g2, [ %g1 + 0x110 ] return _Thread_Dispatch_disable_level; 2006c4c: c2 00 61 10 ld [ %g1 + 0x110 ], %g1 */ RTEMS_INLINE_ROUTINE POSIX_Condition_variables_Control *_POSIX_Condition_variables_Allocate( void ) { return (POSIX_Condition_variables_Control *) 2006c50: 37 00 80 62 sethi %hi(0x2018800), %i3 2006c54: 40 00 09 b8 call 2009334 <_Objects_Allocate> 2006c58: 90 16 e1 68 or %i3, 0x168, %o0 ! 2018968 <_POSIX_Condition_variables_Information> _Thread_Disable_dispatch(); the_cond = _POSIX_Condition_variables_Allocate(); if ( !the_cond ) { 2006c5c: b8 92 20 00 orcc %o0, 0, %i4 2006c60: 32 80 00 06 bne,a 2006c78 2006c64: c2 06 60 04 ld [ %i1 + 4 ], %g1 _Thread_Enable_dispatch(); 2006c68: 40 00 0e 4e call 200a5a0 <_Thread_Enable_dispatch> 2006c6c: b0 10 20 0c mov 0xc, %i0 return ENOMEM; 2006c70: 81 c7 e0 08 ret 2006c74: 81 e8 00 00 restore the_cond->process_shared = the_attr->process_shared; the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 2006c78: 90 07 20 18 add %i4, 0x18, %o0 if ( !the_cond ) { _Thread_Enable_dispatch(); return ENOMEM; } the_cond->process_shared = the_attr->process_shared; 2006c7c: c2 27 20 10 st %g1, [ %i4 + 0x10 ] the_cond->Mutex = POSIX_CONDITION_VARIABLES_NO_MUTEX; _Thread_queue_Initialize( 2006c80: 92 10 20 00 clr %o1 2006c84: 15 04 00 02 sethi %hi(0x10000800), %o2 2006c88: 96 10 20 74 mov 0x74, %o3 2006c8c: 40 00 10 41 call 200ad90 <_Thread_queue_Initialize> 2006c90: c0 27 20 14 clr [ %i4 + 0x14 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006c94: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 *cond = the_cond->Object.id; _Thread_Enable_dispatch(); return 0; } 2006c98: b6 16 e1 68 or %i3, 0x168, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006c9c: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2006ca0: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2006ca4: 85 28 a0 02 sll %g2, 2, %g2 2006ca8: 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; 2006cac: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_Condition_variables_Information, &the_cond->Object, 0 ); *cond = the_cond->Object.id; 2006cb0: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2006cb4: 40 00 0e 3b call 200a5a0 <_Thread_Enable_dispatch> 2006cb8: b0 10 20 00 clr %i0 return 0; } 2006cbc: 81 c7 e0 08 ret 2006cc0: 81 e8 00 00 restore =============================================================================== 02006a74 : */ int pthread_condattr_destroy( pthread_condattr_t *attr ) { 2006a74: 82 10 00 08 mov %o0, %g1 if ( !attr || attr->is_initialized == false ) 2006a78: 80 a0 60 00 cmp %g1, 0 2006a7c: 02 80 00 08 be 2006a9c 2006a80: 90 10 20 16 mov 0x16, %o0 2006a84: c4 00 40 00 ld [ %g1 ], %g2 2006a88: 80 a0 a0 00 cmp %g2, 0 2006a8c: 02 80 00 04 be 2006a9c <== NEVER TAKEN 2006a90: 01 00 00 00 nop return EINVAL; attr->is_initialized = false; 2006a94: c0 20 40 00 clr [ %g1 ] return 0; 2006a98: 90 10 20 00 clr %o0 } 2006a9c: 81 c3 e0 08 retl =============================================================================== 0200608c : pthread_t *thread, const pthread_attr_t *attr, void *(*start_routine)( void * ), void *arg ) { 200608c: 9d e3 bf 58 save %sp, -168, %sp 2006090: ba 10 00 18 mov %i0, %i5 int schedpolicy = SCHED_RR; struct sched_param schedparam; Objects_Name name; int rc; if ( !start_routine ) 2006094: 80 a6 a0 00 cmp %i2, 0 2006098: 02 80 00 66 be 2006230 200609c: b0 10 20 0e mov 0xe, %i0 return EFAULT; the_attr = (attr) ? attr : &_POSIX_Threads_Default_attributes; 20060a0: 80 a6 60 00 cmp %i1, 0 20060a4: 32 80 00 05 bne,a 20060b8 20060a8: c2 06 40 00 ld [ %i1 ], %g1 20060ac: 33 00 80 6e sethi %hi(0x201b800), %i1 20060b0: b2 16 61 04 or %i1, 0x104, %i1 ! 201b904 <_POSIX_Threads_Default_attributes> if ( !the_attr->is_initialized ) 20060b4: c2 06 40 00 ld [ %i1 ], %g1 20060b8: 80 a0 60 00 cmp %g1, 0 20060bc: 02 80 00 5d be 2006230 20060c0: 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) ) 20060c4: c2 06 60 04 ld [ %i1 + 4 ], %g1 20060c8: 80 a0 60 00 cmp %g1, 0 20060cc: 02 80 00 07 be 20060e8 20060d0: 03 00 80 71 sethi %hi(0x201c400), %g1 20060d4: c4 06 60 08 ld [ %i1 + 8 ], %g2 20060d8: c2 00 62 40 ld [ %g1 + 0x240 ], %g1 20060dc: 80 a0 80 01 cmp %g2, %g1 20060e0: 0a 80 00 79 bcs 20062c4 20060e4: 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 ) { 20060e8: c2 06 60 10 ld [ %i1 + 0x10 ], %g1 20060ec: 80 a0 60 01 cmp %g1, 1 20060f0: 02 80 00 06 be 2006108 20060f4: 80 a0 60 02 cmp %g1, 2 20060f8: 12 80 00 4e bne 2006230 20060fc: b0 10 20 16 mov 0x16, %i0 schedpolicy = api->schedpolicy; schedparam = api->schedparam; break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; 2006100: 10 80 00 09 b 2006124 2006104: 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 ]; 2006108: 03 00 80 76 sethi %hi(0x201d800), %g1 200610c: c2 00 60 64 ld [ %g1 + 0x64 ], %g1 ! 201d864 <_Per_CPU_Information+0xc> schedpolicy = api->schedpolicy; schedparam = api->schedparam; 2006110: 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 ]; 2006114: d2 00 61 5c ld [ %g1 + 0x15c ], %o1 schedpolicy = api->schedpolicy; 2006118: e0 02 60 84 ld [ %o1 + 0x84 ], %l0 schedparam = api->schedparam; 200611c: 10 80 00 04 b 200612c 2006120: 92 02 60 88 add %o1, 0x88, %o1 break; case PTHREAD_EXPLICIT_SCHED: schedpolicy = the_attr->schedpolicy; schedparam = the_attr->schedparam; 2006124: 90 07 bf dc add %fp, -36, %o0 2006128: 92 06 60 18 add %i1, 0x18, %o1 200612c: 40 00 26 53 call 200fa78 2006130: 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 ) 2006134: c2 06 60 0c ld [ %i1 + 0xc ], %g1 2006138: 80 a0 60 00 cmp %g1, 0 200613c: 12 80 00 3d bne 2006230 2006140: b0 10 20 86 mov 0x86, %i0 return ENOTSUP; /* * Interpret the scheduling parameters. */ if ( !_POSIX_Priority_Is_valid( schedparam.sched_priority ) ) 2006144: d0 07 bf dc ld [ %fp + -36 ], %o0 2006148: 40 00 19 fa call 200c930 <_POSIX_Priority_Is_valid> 200614c: b0 10 20 16 mov 0x16, %i0 2006150: 80 8a 20 ff btst 0xff, %o0 2006154: 02 80 00 37 be 2006230 <== NEVER TAKEN 2006158: 03 00 80 71 sethi %hi(0x201c400), %g1 return EINVAL; core_priority = _POSIX_Priority_To_core( schedparam.sched_priority ); 200615c: 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); 2006160: e2 08 62 3c ldub [ %g1 + 0x23c ], %l1 /* * Set the core scheduling policy information. */ rc = _POSIX_Thread_Translate_sched_param( 2006164: 90 10 00 10 mov %l0, %o0 2006168: 92 07 bf dc add %fp, -36, %o1 200616c: 94 07 bf f8 add %fp, -8, %o2 2006170: 40 00 19 fb call 200c95c <_POSIX_Thread_Translate_sched_param> 2006174: 96 07 bf fc add %fp, -4, %o3 schedpolicy, &schedparam, &budget_algorithm, &budget_callout ); if ( rc ) 2006178: b0 92 20 00 orcc %o0, 0, %i0 200617c: 12 80 00 2d bne 2006230 2006180: 27 00 80 74 sethi %hi(0x201d000), %l3 #endif /* * Lock the allocator mutex for protection */ _RTEMS_Lock_allocator(); 2006184: 40 00 05 fe call 200797c <_API_Mutex_Lock> 2006188: d0 04 e3 c4 ld [ %l3 + 0x3c4 ], %o0 ! 201d3c4 <_RTEMS_Allocator_Mutex> * _POSIX_Threads_Allocate */ RTEMS_INLINE_ROUTINE Thread_Control *_POSIX_Threads_Allocate( void ) { return (Thread_Control *) _Objects_Allocate( &_POSIX_Threads_Information ); 200618c: 11 00 80 75 sethi %hi(0x201d400), %o0 2006190: 40 00 08 a2 call 2008418 <_Objects_Allocate> 2006194: 90 12 21 60 or %o0, 0x160, %o0 ! 201d560 <_POSIX_Threads_Information> * Allocate the thread control block. * * NOTE: Global threads are not currently supported. */ the_thread = _POSIX_Threads_Allocate(); if ( !the_thread ) { 2006198: b8 92 20 00 orcc %o0, 0, %i4 200619c: 32 80 00 04 bne,a 20061ac 20061a0: c2 06 60 08 ld [ %i1 + 8 ], %g1 _RTEMS_Unlock_allocator(); 20061a4: 10 80 00 21 b 2006228 20061a8: d0 04 e3 c4 ld [ %l3 + 0x3c4 ], %o0 static inline size_t _POSIX_Threads_Ensure_minimum_stack ( size_t size ) { if ( size >= PTHREAD_MINIMUM_STACK_SIZE ) 20061ac: 05 00 80 71 sethi %hi(0x201c400), %g2 20061b0: d6 00 a2 40 ld [ %g2 + 0x240 ], %o3 ! 201c640 /* * Initialize the core thread for this task. */ name.name_p = NULL; /* posix threads don't have a name by default */ status = _Thread_Initialize( 20061b4: 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 ) 20061b8: 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( 20061bc: 80 a2 c0 01 cmp %o3, %g1 20061c0: 1a 80 00 03 bcc 20061cc 20061c4: d4 06 60 04 ld [ %i1 + 4 ], %o2 20061c8: 96 10 00 01 mov %g1, %o3 20061cc: 82 10 20 01 mov 1, %g1 20061d0: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 20061d4: c2 07 bf f8 ld [ %fp + -8 ], %g1 20061d8: 9a 0c 60 ff and %l1, 0xff, %o5 20061dc: c2 23 a0 60 st %g1, [ %sp + 0x60 ] 20061e0: c2 07 bf fc ld [ %fp + -4 ], %g1 20061e4: c0 23 a0 68 clr [ %sp + 0x68 ] 20061e8: c2 23 a0 64 st %g1, [ %sp + 0x64 ] 20061ec: 82 07 bf d4 add %fp, -44, %g1 20061f0: 23 00 80 75 sethi %hi(0x201d400), %l1 20061f4: c2 23 a0 6c st %g1, [ %sp + 0x6c ] 20061f8: 90 14 61 60 or %l1, 0x160, %o0 20061fc: 92 10 00 1c mov %i4, %o1 2006200: 98 10 20 01 mov 1, %o4 2006204: 40 00 0d 58 call 2009764 <_Thread_Initialize> 2006208: 9a 23 40 12 sub %o5, %l2, %o5 budget_callout, 0, /* isr level */ name /* posix threads don't have a name */ ); if ( !status ) { 200620c: 80 8a 20 ff btst 0xff, %o0 2006210: 12 80 00 0a bne 2006238 2006214: 90 14 61 60 or %l1, 0x160, %o0 RTEMS_INLINE_ROUTINE void _POSIX_Threads_Free ( Thread_Control *the_pthread ) { _Objects_Free( &_POSIX_Threads_Information, &the_pthread->Object ); 2006218: 40 00 09 59 call 200877c <_Objects_Free> 200621c: 92 10 00 1c mov %i4, %o1 _POSIX_Threads_Free( the_thread ); _RTEMS_Unlock_allocator(); 2006220: 03 00 80 74 sethi %hi(0x201d000), %g1 2006224: d0 00 63 c4 ld [ %g1 + 0x3c4 ], %o0 ! 201d3c4 <_RTEMS_Allocator_Mutex> 2006228: 40 00 05 ea call 20079d0 <_API_Mutex_Unlock> 200622c: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 2006230: 81 c7 e0 08 ret 2006234: 81 e8 00 00 restore } /* * finish initializing the per API structure */ api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 2006238: e2 07 21 5c ld [ %i4 + 0x15c ], %l1 api->Attributes = *the_attr; 200623c: 92 10 00 19 mov %i1, %o1 2006240: 94 10 20 40 mov 0x40, %o2 2006244: 40 00 26 0d call 200fa78 2006248: 90 10 00 11 mov %l1, %o0 api->detachstate = the_attr->detachstate; 200624c: c2 06 60 3c ld [ %i1 + 0x3c ], %g1 api->schedpolicy = schedpolicy; api->schedparam = schedparam; 2006250: 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; 2006254: c2 24 60 40 st %g1, [ %l1 + 0x40 ] api->schedpolicy = schedpolicy; api->schedparam = schedparam; 2006258: 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; 200625c: e0 24 60 84 st %l0, [ %l1 + 0x84 ] api->schedparam = schedparam; 2006260: 40 00 26 06 call 200fa78 2006264: 90 04 60 88 add %l1, 0x88, %o0 /* * POSIX threads are allocated and started in one operation. */ status = _Thread_Start( 2006268: 90 10 00 1c mov %i4, %o0 200626c: 92 10 20 01 mov 1, %o1 2006270: 94 10 00 1a mov %i2, %o2 2006274: 96 10 00 1b mov %i3, %o3 2006278: 40 00 0f 8f call 200a0b4 <_Thread_Start> 200627c: 98 10 20 00 clr %o4 _RTEMS_Unlock_allocator(); return EINVAL; } #endif if ( schedpolicy == SCHED_SPORADIC ) { 2006280: 80 a4 20 04 cmp %l0, 4 2006284: 32 80 00 0a bne,a 20062ac 2006288: c2 07 20 08 ld [ %i4 + 8 ], %g1 _Watchdog_Insert_ticks( 200628c: 40 00 10 08 call 200a2ac <_Timespec_To_ticks> 2006290: 90 04 60 90 add %l1, 0x90, %o0 ) { the_watchdog->initial = units; _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2006294: 92 04 60 a8 add %l1, 0xa8, %o1 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2006298: d0 24 60 b4 st %o0, [ %l1 + 0xb4 ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 200629c: 11 00 80 74 sethi %hi(0x201d000), %o0 20062a0: 40 00 10 db call 200a60c <_Watchdog_Insert> 20062a4: 90 12 23 e4 or %o0, 0x3e4, %o0 ! 201d3e4 <_Watchdog_Ticks_chain> } /* * Return the id and indicate we successfully created the thread */ *thread = the_thread->Object.id; 20062a8: c2 07 20 08 ld [ %i4 + 8 ], %g1 20062ac: c2 27 40 00 st %g1, [ %i5 ] _RTEMS_Unlock_allocator(); 20062b0: 03 00 80 74 sethi %hi(0x201d000), %g1 20062b4: 40 00 05 c7 call 20079d0 <_API_Mutex_Unlock> 20062b8: d0 00 63 c4 ld [ %g1 + 0x3c4 ], %o0 ! 201d3c4 <_RTEMS_Allocator_Mutex> return 0; 20062bc: 81 c7 e0 08 ret 20062c0: 81 e8 00 00 restore } 20062c4: 81 c7 e0 08 ret 20062c8: 81 e8 00 00 restore =============================================================================== 0201980c : int pthread_kill( pthread_t thread, int sig ) { 201980c: 9d e3 bf 98 save %sp, -104, %sp POSIX_API_Control *api; Thread_Control *the_thread; Objects_Locations location; if ( !sig ) 2019810: 80 a6 60 00 cmp %i1, 0 2019814: 02 80 00 06 be 201982c 2019818: 90 10 00 18 mov %i0, %o0 static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 201981c: b6 06 7f ff add %i1, -1, %i3 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 2019820: 80 a6 e0 1f cmp %i3, 0x1f 2019824: 08 80 00 08 bleu 2019844 2019828: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); 201982c: 7f ff d4 4a call 200e954 <__errno> 2019830: b0 10 3f ff mov -1, %i0 ! ffffffff 2019834: 82 10 20 16 mov 0x16, %g1 2019838: c2 22 00 00 st %g1, [ %o0 ] 201983c: 81 c7 e0 08 ret 2019840: 81 e8 00 00 restore the_thread = _Thread_Get( thread, &location ); 2019844: 7f ff bc d9 call 2008ba8 <_Thread_Get> 2019848: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 201984c: c2 07 bf fc ld [ %fp + -4 ], %g1 2019850: 80 a0 60 00 cmp %g1, 0 2019854: 12 80 00 22 bne 20198dc <== NEVER TAKEN 2019858: 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 ) { 201985c: 85 2e 60 02 sll %i1, 2, %g2 2019860: 87 2e 60 04 sll %i1, 4, %g3 2019864: 86 20 c0 02 sub %g3, %g2, %g3 2019868: 05 00 80 73 sethi %hi(0x201cc00), %g2 201986c: 84 10 a2 90 or %g2, 0x290, %g2 ! 201ce90 <_POSIX_signals_Vectors> 2019870: 84 00 80 03 add %g2, %g3, %g2 2019874: c4 00 a0 08 ld [ %g2 + 8 ], %g2 2019878: 80 a0 a0 01 cmp %g2, 1 201987c: 02 80 00 14 be 20198cc 2019880: c2 02 21 5c ld [ %o0 + 0x15c ], %g1 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 2019884: c4 00 60 d4 ld [ %g1 + 0xd4 ], %g2 static inline sigset_t signo_to_mask( uint32_t sig ) { return 1u << (sig - 1); 2019888: ba 10 20 01 mov 1, %i5 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 201988c: 92 10 00 19 mov %i1, %o1 2019890: b7 2f 40 1b sll %i5, %i3, %i3 2019894: 94 10 20 00 clr %o2 return 0; } /* XXX critical section */ api->signals_pending |= signo_to_mask( sig ); 2019898: b6 10 80 1b or %g2, %i3, %i3 (void) _POSIX_signals_Unblock_thread( the_thread, sig, NULL ); 201989c: 7f ff ff 89 call 20196c0 <_POSIX_signals_Unblock_thread> 20198a0: f6 20 60 d4 st %i3, [ %g1 + 0xd4 ] if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 20198a4: 03 00 80 73 sethi %hi(0x201cc00), %g1 20198a8: 82 10 62 38 or %g1, 0x238, %g1 ! 201ce38 <_Per_CPU_Information> 20198ac: c4 00 60 08 ld [ %g1 + 8 ], %g2 20198b0: 80 a0 a0 00 cmp %g2, 0 20198b4: 02 80 00 06 be 20198cc 20198b8: 01 00 00 00 nop 20198bc: c4 00 60 0c ld [ %g1 + 0xc ], %g2 20198c0: 80 a7 00 02 cmp %i4, %g2 20198c4: 22 80 00 02 be,a 20198cc 20198c8: fa 28 60 18 stb %i5, [ %g1 + 0x18 ] _Thread_Dispatch_necessary = true; } _Thread_Enable_dispatch(); 20198cc: 7f ff bc ab call 2008b78 <_Thread_Enable_dispatch> 20198d0: b0 10 20 00 clr %i0 return 0; 20198d4: 81 c7 e0 08 ret 20198d8: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( ESRCH ); 20198dc: 7f ff d4 1e call 200e954 <__errno> <== NOT EXECUTED 20198e0: b0 10 3f ff mov -1, %i0 <== NOT EXECUTED 20198e4: 82 10 20 03 mov 3, %g1 <== NOT EXECUTED 20198e8: c2 22 00 00 st %g1, [ %o0 ] <== NOT EXECUTED } 20198ec: 81 c7 e0 08 ret <== NOT EXECUTED 20198f0: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 02008178 : int pthread_mutex_timedlock( pthread_mutex_t *mutex, const struct timespec *abstime ) { 2008178: 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 ); 200817c: 92 07 bf fc add %fp, -4, %o1 2008180: 40 00 00 37 call 200825c <_POSIX_Absolute_timeout_to_ticks> 2008184: 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 ); 2008188: 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, 200818c: 82 1a 20 03 xor %o0, 3, %g1 2008190: 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 ); 2008194: 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 ); 2008198: b8 60 3f ff subx %g0, -1, %i4 200819c: 90 10 00 18 mov %i0, %o0 20081a0: 7f ff ff bd call 2008094 <_POSIX_Mutex_Lock_support> 20081a4: 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) ) { 20081a8: 80 a7 20 00 cmp %i4, 0 20081ac: 12 80 00 0d bne 20081e0 20081b0: b0 10 00 08 mov %o0, %i0 20081b4: 80 a2 20 10 cmp %o0, 0x10 20081b8: 12 80 00 0a bne 20081e0 <== NEVER TAKEN 20081bc: 80 a7 60 00 cmp %i5, 0 if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 20081c0: 02 80 00 07 be 20081dc <== NEVER TAKEN 20081c4: ba 07 7f ff add %i5, -1, %i5 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 20081c8: 80 a7 60 01 cmp %i5, 1 20081cc: 18 80 00 05 bgu 20081e0 <== NEVER TAKEN 20081d0: 01 00 00 00 nop status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; 20081d4: 81 c7 e0 08 ret 20081d8: 91 e8 20 74 restore %g0, 0x74, %o0 20081dc: b0 10 20 16 mov 0x16, %i0 <== NOT EXECUTED } return lock_status; } 20081e0: 81 c7 e0 08 ret 20081e4: 81 e8 00 00 restore =============================================================================== 02005954 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_gettype( const pthread_mutexattr_t *attr, int *type ) { 2005954: 82 10 00 08 mov %o0, %g1 if ( !attr ) 2005958: 80 a0 60 00 cmp %g1, 0 200595c: 02 80 00 0b be 2005988 2005960: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2005964: c4 00 40 00 ld [ %g1 ], %g2 2005968: 80 a0 a0 00 cmp %g2, 0 200596c: 02 80 00 07 be 2005988 2005970: 80 a2 60 00 cmp %o1, 0 return EINVAL; if ( !type ) 2005974: 02 80 00 05 be 2005988 <== NEVER TAKEN 2005978: 01 00 00 00 nop return EINVAL; *type = attr->type; 200597c: c2 00 60 10 ld [ %g1 + 0x10 ], %g1 return 0; 2005980: 90 10 20 00 clr %o0 return EINVAL; if ( !type ) return EINVAL; *type = attr->type; 2005984: c2 22 40 00 st %g1, [ %o1 ] return 0; } 2005988: 81 c3 e0 08 retl =============================================================================== 02007d68 : int pthread_mutexattr_setpshared( pthread_mutexattr_t *attr, int pshared ) { 2007d68: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 2007d6c: 80 a0 60 00 cmp %g1, 0 2007d70: 02 80 00 0a be 2007d98 2007d74: 90 10 20 16 mov 0x16, %o0 2007d78: c4 00 40 00 ld [ %g1 ], %g2 2007d7c: 80 a0 a0 00 cmp %g2, 0 2007d80: 02 80 00 06 be 2007d98 2007d84: 80 a2 60 01 cmp %o1, 1 return EINVAL; switch ( pshared ) { 2007d88: 18 80 00 04 bgu 2007d98 <== NEVER TAKEN 2007d8c: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 2007d90: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; 2007d94: 90 10 20 00 clr %o0 default: return EINVAL; } } 2007d98: 81 c3 e0 08 retl =============================================================================== 020059c0 : #if defined(_UNIX98_THREAD_MUTEX_ATTRIBUTES) int pthread_mutexattr_settype( pthread_mutexattr_t *attr, int type ) { 20059c0: 82 10 00 08 mov %o0, %g1 if ( !attr || !attr->is_initialized ) 20059c4: 80 a0 60 00 cmp %g1, 0 20059c8: 02 80 00 0a be 20059f0 20059cc: 90 10 20 16 mov 0x16, %o0 20059d0: c4 00 40 00 ld [ %g1 ], %g2 20059d4: 80 a0 a0 00 cmp %g2, 0 20059d8: 02 80 00 06 be 20059f0 <== NEVER TAKEN 20059dc: 80 a2 60 03 cmp %o1, 3 return EINVAL; switch ( type ) { 20059e0: 18 80 00 04 bgu 20059f0 20059e4: 01 00 00 00 nop case PTHREAD_MUTEX_NORMAL: case PTHREAD_MUTEX_RECURSIVE: case PTHREAD_MUTEX_ERRORCHECK: case PTHREAD_MUTEX_DEFAULT: attr->type = type; 20059e8: d2 20 60 10 st %o1, [ %g1 + 0x10 ] return 0; 20059ec: 90 10 20 00 clr %o0 default: return EINVAL; } } 20059f0: 81 c3 e0 08 retl =============================================================================== 020066a0 : int pthread_once( pthread_once_t *once_control, void (*init_routine)(void) ) { 20066a0: 9d e3 bf 98 save %sp, -104, %sp if ( !once_control || !init_routine ) 20066a4: 80 a6 60 00 cmp %i1, 0 20066a8: 02 80 00 1c be 2006718 20066ac: ba 10 00 18 mov %i0, %i5 20066b0: 80 a6 20 00 cmp %i0, 0 20066b4: 22 80 00 17 be,a 2006710 20066b8: b0 10 20 16 mov 0x16, %i0 return EINVAL; if ( !once_control->init_executed ) { 20066bc: c2 06 20 04 ld [ %i0 + 4 ], %g1 20066c0: 80 a0 60 00 cmp %g1, 0 20066c4: 12 80 00 13 bne 2006710 20066c8: b0 10 20 00 clr %i0 rtems_mode saveMode; rtems_task_mode(RTEMS_NO_PREEMPT, RTEMS_PREEMPT_MASK, &saveMode); 20066cc: 90 10 21 00 mov 0x100, %o0 20066d0: 92 10 21 00 mov 0x100, %o1 20066d4: 40 00 03 04 call 20072e4 20066d8: 94 07 bf fc add %fp, -4, %o2 if ( !once_control->init_executed ) { 20066dc: c2 07 60 04 ld [ %i5 + 4 ], %g1 20066e0: 80 a0 60 00 cmp %g1, 0 20066e4: 12 80 00 07 bne 2006700 <== NEVER TAKEN 20066e8: d0 07 bf fc ld [ %fp + -4 ], %o0 once_control->is_initialized = true; 20066ec: 82 10 20 01 mov 1, %g1 20066f0: c2 27 40 00 st %g1, [ %i5 ] once_control->init_executed = true; (*init_routine)(); 20066f4: 9f c6 40 00 call %i1 20066f8: c2 27 60 04 st %g1, [ %i5 + 4 ] } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); 20066fc: d0 07 bf fc ld [ %fp + -4 ], %o0 2006700: 92 10 21 00 mov 0x100, %o1 2006704: 94 07 bf fc add %fp, -4, %o2 2006708: 40 00 02 f7 call 20072e4 200670c: b0 10 20 00 clr %i0 2006710: 81 c7 e0 08 ret 2006714: 81 e8 00 00 restore pthread_once_t *once_control, void (*init_routine)(void) ) { if ( !once_control || !init_routine ) return EINVAL; 2006718: b0 10 20 16 mov 0x16, %i0 (*init_routine)(); } rtems_task_mode(saveMode, RTEMS_PREEMPT_MASK, &saveMode); } return 0; } 200671c: 81 c7 e0 08 ret 2006720: 81 e8 00 00 restore =============================================================================== 02007074 : int pthread_rwlock_init( pthread_rwlock_t *rwlock, const pthread_rwlockattr_t *attr ) { 2007074: 9d e3 bf 90 save %sp, -112, %sp 2007078: ba 10 00 18 mov %i0, %i5 const pthread_rwlockattr_t *the_attr; /* * Error check parameters */ if ( !rwlock ) 200707c: 80 a7 60 00 cmp %i5, 0 2007080: 02 80 00 1d be 20070f4 2007084: b0 10 20 16 mov 0x16, %i0 return EINVAL; /* * If the user passed in NULL, use the default attributes */ if ( attr ) { 2007088: 80 a6 60 00 cmp %i1, 0 200708c: 32 80 00 06 bne,a 20070a4 2007090: c2 06 40 00 ld [ %i1 ], %g1 the_attr = attr; } else { (void) pthread_rwlockattr_init( &default_attr ); 2007094: 90 07 bf f4 add %fp, -12, %o0 2007098: 40 00 02 6c call 2007a48 200709c: 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 ) 20070a0: c2 06 40 00 ld [ %i1 ], %g1 20070a4: 80 a0 60 00 cmp %g1, 0 20070a8: 02 80 00 13 be 20070f4 <== NEVER TAKEN 20070ac: b0 10 20 16 mov 0x16, %i0 return EINVAL; switch ( the_attr->process_shared ) { 20070b0: c2 06 60 04 ld [ %i1 + 4 ], %g1 20070b4: 80 a0 60 00 cmp %g1, 0 20070b8: 12 80 00 0f bne 20070f4 <== NEVER TAKEN 20070bc: 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++; 20070c0: c4 00 62 70 ld [ %g1 + 0x270 ], %g2 ! 2019a70 <_Thread_Dispatch_disable_level> */ RTEMS_INLINE_ROUTINE void _CORE_RWLock_Initialize_attributes( CORE_RWLock_Attributes *the_attributes ) { the_attributes->XXX = 0; 20070c4: c0 27 bf fc clr [ %fp + -4 ] 20070c8: 84 00 a0 01 inc %g2 20070cc: c4 20 62 70 st %g2, [ %g1 + 0x270 ] return _Thread_Dispatch_disable_level; 20070d0: c2 00 62 70 ld [ %g1 + 0x270 ], %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 *) 20070d4: 37 00 80 67 sethi %hi(0x2019c00), %i3 20070d8: 40 00 09 e1 call 200985c <_Objects_Allocate> 20070dc: 90 16 e0 70 or %i3, 0x70, %o0 ! 2019c70 <_POSIX_RWLock_Information> */ _Thread_Disable_dispatch(); /* prevents deletion */ the_rwlock = _POSIX_RWLock_Allocate(); if ( !the_rwlock ) { 20070e0: b8 92 20 00 orcc %o0, 0, %i4 20070e4: 12 80 00 06 bne 20070fc 20070e8: 90 07 20 10 add %i4, 0x10, %o0 _Thread_Enable_dispatch(); 20070ec: 40 00 0e 77 call 200aac8 <_Thread_Enable_dispatch> 20070f0: b0 10 20 0b mov 0xb, %i0 return EAGAIN; 20070f4: 81 c7 e0 08 ret 20070f8: 81 e8 00 00 restore } _CORE_RWLock_Initialize( &the_rwlock->RWLock, &the_attributes ); 20070fc: 40 00 07 87 call 2008f18 <_CORE_RWLock_Initialize> 2007100: 92 07 bf fc add %fp, -4, %o1 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007104: c4 17 20 0a lduh [ %i4 + 0xa ], %g2 *rwlock = the_rwlock->Object.id; _Thread_Enable_dispatch(); return 0; } 2007108: b6 16 e0 70 or %i3, 0x70, %i3 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 200710c: c6 06 e0 1c ld [ %i3 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2007110: c2 07 20 08 ld [ %i4 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2007114: 85 28 a0 02 sll %g2, 2, %g2 2007118: f8 20 c0 02 st %i4, [ %g3 + %g2 ] _Objects_Get_index( the_object->id ), the_object ); /* ASSERT: information->is_string == false */ the_object->name.name_u32 = name; 200711c: c0 27 20 0c clr [ %i4 + 0xc ] &_POSIX_RWLock_Information, &the_rwlock->Object, 0 ); *rwlock = the_rwlock->Object.id; 2007120: c2 27 40 00 st %g1, [ %i5 ] _Thread_Enable_dispatch(); 2007124: 40 00 0e 69 call 200aac8 <_Thread_Enable_dispatch> 2007128: b0 10 20 00 clr %i0 return 0; } 200712c: 81 c7 e0 08 ret 2007130: 81 e8 00 00 restore =============================================================================== 020071a4 : int pthread_rwlock_timedrdlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 20071a4: 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; 20071a8: 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 ) 20071ac: 80 a6 20 00 cmp %i0, 0 20071b0: 02 80 00 2b be 200725c 20071b4: 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 ); 20071b8: 40 00 1a c0 call 200dcb8 <_POSIX_Absolute_timeout_to_ticks> 20071bc: 92 07 bf fc add %fp, -4, %o1 20071c0: d2 06 00 00 ld [ %i0 ], %o1 20071c4: b8 10 00 08 mov %o0, %i4 20071c8: 94 07 bf f8 add %fp, -8, %o2 20071cc: 11 00 80 67 sethi %hi(0x2019c00), %o0 20071d0: 40 00 0a de call 2009d48 <_Objects_Get> 20071d4: 90 12 20 70 or %o0, 0x70, %o0 ! 2019c70 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 20071d8: c2 07 bf f8 ld [ %fp + -8 ], %g1 20071dc: 80 a0 60 00 cmp %g1, 0 20071e0: 12 80 00 1f bne 200725c 20071e4: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_reading( 20071e8: 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, 20071ec: 82 1f 20 03 xor %i4, 3, %g1 20071f0: 90 02 20 10 add %o0, 0x10, %o0 20071f4: 80 a0 00 01 cmp %g0, %g1 20071f8: 98 10 20 00 clr %o4 20071fc: b6 60 3f ff subx %g0, -1, %i3 2007200: 40 00 07 50 call 2008f40 <_CORE_RWLock_Obtain_for_reading> 2007204: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 2007208: 40 00 0e 30 call 200aac8 <_Thread_Enable_dispatch> 200720c: 01 00 00 00 nop if ( !do_wait ) { 2007210: 80 a6 e0 00 cmp %i3, 0 2007214: 12 80 00 0d bne 2007248 2007218: 03 00 80 67 sethi %hi(0x2019c00), %g1 if ( _Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE ) { 200721c: c2 00 63 b4 ld [ %g1 + 0x3b4 ], %g1 ! 2019fb4 <_Per_CPU_Information+0xc> 2007220: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2007224: 80 a0 60 02 cmp %g1, 2 2007228: 32 80 00 09 bne,a 200724c 200722c: 03 00 80 67 sethi %hi(0x2019c00), %g1 if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 2007230: 80 a7 20 00 cmp %i4, 0 2007234: 02 80 00 0a be 200725c <== NEVER TAKEN 2007238: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 200723c: 80 a7 20 01 cmp %i4, 1 2007240: 08 80 00 07 bleu 200725c <== ALWAYS TAKEN 2007244: 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 2007248: 03 00 80 67 sethi %hi(0x2019c00), %g1 200724c: c2 00 63 b4 ld [ %g1 + 0x3b4 ], %g1 ! 2019fb4 <_Per_CPU_Information+0xc> status == POSIX_ABSOLUTE_TIMEOUT_IS_NOW ) return ETIMEDOUT; } } return _POSIX_RWLock_Translate_core_RWLock_return_code( 2007250: 40 00 00 35 call 2007324 <_POSIX_RWLock_Translate_core_RWLock_return_code> 2007254: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 2007258: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 200725c: 81 c7 e0 08 ret 2007260: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02007264 : int pthread_rwlock_timedwrlock( pthread_rwlock_t *rwlock, const struct timespec *abstime ) { 2007264: 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; 2007268: 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 ) 200726c: 80 a6 20 00 cmp %i0, 0 2007270: 02 80 00 2b be 200731c 2007274: 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 ); 2007278: 40 00 1a 90 call 200dcb8 <_POSIX_Absolute_timeout_to_ticks> 200727c: 92 07 bf fc add %fp, -4, %o1 2007280: d2 06 00 00 ld [ %i0 ], %o1 2007284: b8 10 00 08 mov %o0, %i4 2007288: 94 07 bf f8 add %fp, -8, %o2 200728c: 11 00 80 67 sethi %hi(0x2019c00), %o0 2007290: 40 00 0a ae call 2009d48 <_Objects_Get> 2007294: 90 12 20 70 or %o0, 0x70, %o0 ! 2019c70 <_POSIX_RWLock_Information> if ( status != POSIX_ABSOLUTE_TIMEOUT_IS_IN_FUTURE ) do_wait = false; the_rwlock = _POSIX_RWLock_Get( rwlock, &location ); switch ( location ) { 2007298: c2 07 bf f8 ld [ %fp + -8 ], %g1 200729c: 80 a0 60 00 cmp %g1, 0 20072a0: 12 80 00 1f bne 200731c 20072a4: d6 07 bf fc ld [ %fp + -4 ], %o3 case OBJECTS_LOCAL: _CORE_RWLock_Obtain_for_writing( 20072a8: 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, 20072ac: 82 1f 20 03 xor %i4, 3, %g1 20072b0: 90 02 20 10 add %o0, 0x10, %o0 20072b4: 80 a0 00 01 cmp %g0, %g1 20072b8: 98 10 20 00 clr %o4 20072bc: b6 60 3f ff subx %g0, -1, %i3 20072c0: 40 00 07 54 call 2009010 <_CORE_RWLock_Obtain_for_writing> 20072c4: 94 10 00 1b mov %i3, %o2 do_wait, ticks, NULL ); _Thread_Enable_dispatch(); 20072c8: 40 00 0e 00 call 200aac8 <_Thread_Enable_dispatch> 20072cc: 01 00 00 00 nop if ( !do_wait && 20072d0: 80 a6 e0 00 cmp %i3, 0 20072d4: 12 80 00 0d bne 2007308 20072d8: 03 00 80 67 sethi %hi(0x2019c00), %g1 (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { 20072dc: c2 00 63 b4 ld [ %g1 + 0x3b4 ], %g1 ! 2019fb4 <_Per_CPU_Information+0xc> ticks, NULL ); _Thread_Enable_dispatch(); if ( !do_wait && 20072e0: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 20072e4: 80 a0 60 02 cmp %g1, 2 20072e8: 32 80 00 09 bne,a 200730c 20072ec: 03 00 80 67 sethi %hi(0x2019c00), %g1 (_Thread_Executing->Wait.return_code == CORE_RWLOCK_UNAVAILABLE) ) { if ( status == POSIX_ABSOLUTE_TIMEOUT_INVALID ) 20072f0: 80 a7 20 00 cmp %i4, 0 20072f4: 02 80 00 0a be 200731c <== NEVER TAKEN 20072f8: b8 07 3f ff add %i4, -1, %i4 return EINVAL; if ( status == POSIX_ABSOLUTE_TIMEOUT_IS_IN_PAST || 20072fc: 80 a7 20 01 cmp %i4, 1 2007300: 08 80 00 07 bleu 200731c <== ALWAYS TAKEN 2007304: 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 2007308: 03 00 80 67 sethi %hi(0x2019c00), %g1 200730c: c2 00 63 b4 ld [ %g1 + 0x3b4 ], %g1 ! 2019fb4 <_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( 2007310: 40 00 00 05 call 2007324 <_POSIX_RWLock_Translate_core_RWLock_return_code> 2007314: d0 00 60 34 ld [ %g1 + 0x34 ], %o0 2007318: ba 10 00 08 mov %o0, %i5 case OBJECTS_ERROR: break; } return EINVAL; } 200731c: 81 c7 e0 08 ret 2007320: 91 e8 00 1d restore %g0, %i5, %o0 =============================================================================== 02007a70 : int pthread_rwlockattr_setpshared( pthread_rwlockattr_t *attr, int pshared ) { 2007a70: 82 10 00 08 mov %o0, %g1 if ( !attr ) 2007a74: 80 a0 60 00 cmp %g1, 0 2007a78: 02 80 00 0a be 2007aa0 2007a7c: 90 10 20 16 mov 0x16, %o0 return EINVAL; if ( !attr->is_initialized ) 2007a80: c4 00 40 00 ld [ %g1 ], %g2 2007a84: 80 a0 a0 00 cmp %g2, 0 2007a88: 02 80 00 06 be 2007aa0 2007a8c: 80 a2 60 01 cmp %o1, 1 return EINVAL; switch ( pshared ) { 2007a90: 18 80 00 04 bgu 2007aa0 <== NEVER TAKEN 2007a94: 01 00 00 00 nop case PTHREAD_PROCESS_SHARED: case PTHREAD_PROCESS_PRIVATE: attr->process_shared = pshared; 2007a98: d2 20 60 04 st %o1, [ %g1 + 4 ] return 0; 2007a9c: 90 10 20 00 clr %o0 default: return EINVAL; } } 2007aa0: 81 c3 e0 08 retl =============================================================================== 02008994 : int pthread_setschedparam( pthread_t thread, int policy, struct sched_param *param ) { 2008994: 9d e3 bf 90 save %sp, -112, %sp 2008998: ba 10 00 18 mov %i0, %i5 int rc; /* * Check all the parameters */ if ( !param ) 200899c: 80 a6 a0 00 cmp %i2, 0 20089a0: 02 80 00 3d be 2008a94 20089a4: b0 10 20 16 mov 0x16, %i0 return EINVAL; rc = _POSIX_Thread_Translate_sched_param( 20089a8: 90 10 00 19 mov %i1, %o0 20089ac: 92 10 00 1a mov %i2, %o1 20089b0: 94 07 bf f4 add %fp, -12, %o2 20089b4: 40 00 18 79 call 200eb98 <_POSIX_Thread_Translate_sched_param> 20089b8: 96 07 bf f8 add %fp, -8, %o3 policy, param, &budget_algorithm, &budget_callout ); if ( rc ) 20089bc: b0 92 20 00 orcc %o0, 0, %i0 20089c0: 12 80 00 35 bne 2008a94 20089c4: 90 10 00 1d mov %i5, %o0 return rc; /* * Actually change the scheduling policy and parameters */ the_thread = _Thread_Get( thread, &location ); 20089c8: 40 00 0b a2 call 200b850 <_Thread_Get> 20089cc: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 20089d0: c2 07 bf fc ld [ %fp + -4 ], %g1 20089d4: 80 a0 60 00 cmp %g1, 0 20089d8: 12 80 00 31 bne 2008a9c 20089dc: b8 10 00 08 mov %o0, %i4 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_POSIX ]; 20089e0: fa 02 21 5c ld [ %o0 + 0x15c ], %i5 if ( api->schedpolicy == SCHED_SPORADIC ) 20089e4: c2 07 60 84 ld [ %i5 + 0x84 ], %g1 20089e8: 80 a0 60 04 cmp %g1, 4 20089ec: 32 80 00 05 bne,a 2008a00 20089f0: f2 27 60 84 st %i1, [ %i5 + 0x84 ] (void) _Watchdog_Remove( &api->Sporadic_timer ); 20089f4: 40 00 0f fa call 200c9dc <_Watchdog_Remove> 20089f8: 90 07 60 a8 add %i5, 0xa8, %o0 api->schedpolicy = policy; 20089fc: f2 27 60 84 st %i1, [ %i5 + 0x84 ] api->schedparam = *param; 2008a00: 90 07 60 88 add %i5, 0x88, %o0 2008a04: 92 10 00 1a mov %i2, %o1 2008a08: 40 00 25 09 call 2011e2c 2008a0c: 94 10 20 1c mov 0x1c, %o2 the_thread->budget_algorithm = budget_algorithm; 2008a10: c2 07 bf f4 ld [ %fp + -12 ], %g1 the_thread->budget_callout = budget_callout; switch ( api->schedpolicy ) { 2008a14: 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; 2008a18: c2 27 20 7c st %g1, [ %i4 + 0x7c ] the_thread->budget_callout = budget_callout; 2008a1c: c2 07 bf f8 ld [ %fp + -8 ], %g1 switch ( api->schedpolicy ) { 2008a20: 06 80 00 1b bl 2008a8c <== NEVER TAKEN 2008a24: c2 27 20 80 st %g1, [ %i4 + 0x80 ] 2008a28: 80 a6 60 02 cmp %i1, 2 2008a2c: 04 80 00 07 ble 2008a48 2008a30: 03 00 80 6c sethi %hi(0x201b000), %g1 2008a34: 80 a6 60 04 cmp %i1, 4 2008a38: 12 80 00 15 bne 2008a8c <== NEVER TAKEN 2008a3c: 01 00 00 00 nop true ); break; case SCHED_SPORADIC: api->ss_high_priority = api->schedparam.sched_priority; 2008a40: 10 80 00 0d b 2008a74 2008a44: 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; 2008a48: c2 00 60 54 ld [ %g1 + 0x54 ], %g1 the_thread->real_priority = _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 2008a4c: 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; 2008a50: c2 27 20 78 st %g1, [ %i4 + 0x78 ] 2008a54: 03 00 80 68 sethi %hi(0x201a000), %g1 2008a58: d2 08 63 ac ldub [ %g1 + 0x3ac ], %o1 ! 201a3ac 2008a5c: c2 07 60 88 ld [ %i5 + 0x88 ], %g1 the_thread->real_priority = _POSIX_Priority_To_core( api->schedparam.sched_priority ); _Thread_Change_priority( 2008a60: 94 10 20 01 mov 1, %o2 2008a64: 92 22 40 01 sub %o1, %g1, %o1 2008a68: 40 00 0a 4b call 200b394 <_Thread_Change_priority> 2008a6c: d2 27 20 18 st %o1, [ %i4 + 0x18 ] the_thread, the_thread->real_priority, true ); break; 2008a70: 30 80 00 07 b,a 2008a8c case SCHED_SPORADIC: api->ss_high_priority = api->schedparam.sched_priority; _Watchdog_Remove( &api->Sporadic_timer ); 2008a74: 90 07 60 a8 add %i5, 0xa8, %o0 2008a78: 40 00 0f d9 call 200c9dc <_Watchdog_Remove> 2008a7c: c2 27 60 a4 st %g1, [ %i5 + 0xa4 ] _POSIX_Threads_Sporadic_budget_TSR( 0, the_thread ); 2008a80: 90 10 20 00 clr %o0 2008a84: 7f ff ff 80 call 2008884 <_POSIX_Threads_Sporadic_budget_TSR> 2008a88: 92 10 00 1c mov %i4, %o1 break; } _Thread_Enable_dispatch(); 2008a8c: 40 00 0b 65 call 200b820 <_Thread_Enable_dispatch> 2008a90: 01 00 00 00 nop return 0; 2008a94: 81 c7 e0 08 ret 2008a98: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } return ESRCH; 2008a9c: b0 10 20 03 mov 3, %i0 } 2008aa0: 81 c7 e0 08 ret 2008aa4: 81 e8 00 00 restore =============================================================================== 020063a8 : * * 18.2.2 Setting Cancelability State, P1003.1c/Draft 10, p. 183 */ void pthread_testcancel( void ) { 20063a8: 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() ) 20063ac: 03 00 80 5f sethi %hi(0x2017c00), %g1 20063b0: 82 10 61 78 or %g1, 0x178, %g1 ! 2017d78 <_Per_CPU_Information> 20063b4: c4 00 60 08 ld [ %g1 + 8 ], %g2 20063b8: 80 a0 a0 00 cmp %g2, 0 20063bc: 12 80 00 19 bne 2006420 <== NEVER TAKEN 20063c0: 01 00 00 00 nop return; thread_support = _Thread_Executing->API_Extensions[ THREAD_API_POSIX ]; 20063c4: c2 00 60 0c ld [ %g1 + 0xc ], %g1 20063c8: 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++; 20063cc: 03 00 80 5e sethi %hi(0x2017800), %g1 20063d0: c6 00 60 40 ld [ %g1 + 0x40 ], %g3 ! 2017840 <_Thread_Dispatch_disable_level> 20063d4: 86 00 e0 01 inc %g3 20063d8: c6 20 60 40 st %g3, [ %g1 + 0x40 ] return _Thread_Dispatch_disable_level; 20063dc: c2 00 60 40 ld [ %g1 + 0x40 ], %g1 _Thread_Disable_dispatch(); if ( thread_support->cancelability_state == PTHREAD_CANCEL_ENABLE && 20063e0: c2 00 a0 d8 ld [ %g2 + 0xd8 ], %g1 20063e4: 80 a0 60 00 cmp %g1, 0 20063e8: 12 80 00 05 bne 20063fc <== NEVER TAKEN 20063ec: 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)); 20063f0: c2 00 a0 e0 ld [ %g2 + 0xe0 ], %g1 20063f4: 80 a0 00 01 cmp %g0, %g1 20063f8: ba 40 20 00 addx %g0, 0, %i5 thread_support->cancelation_requested ) cancel = true; _Thread_Enable_dispatch(); 20063fc: 40 00 0b 39 call 20090e0 <_Thread_Enable_dispatch> 2006400: 01 00 00 00 nop if ( cancel ) 2006404: 80 8f 60 ff btst 0xff, %i5 2006408: 02 80 00 06 be 2006420 200640c: 01 00 00 00 nop _POSIX_Thread_Exit( _Thread_Executing, PTHREAD_CANCELED ); 2006410: 03 00 80 5f sethi %hi(0x2017c00), %g1 2006414: f0 00 61 84 ld [ %g1 + 0x184 ], %i0 ! 2017d84 <_Per_CPU_Information+0xc> 2006418: 40 00 18 59 call 200c57c <_POSIX_Thread_Exit> 200641c: 93 e8 3f ff restore %g0, -1, %o1 2006420: 81 c7 e0 08 ret 2006424: 81 e8 00 00 restore =============================================================================== 02006f34 : * errno - otherwise */ int rtems_aio_enqueue (rtems_aio_request *req) { 2006f34: 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); 2006f38: 3b 00 80 62 sethi %hi(0x2018800), %i5 2006f3c: 40 00 02 77 call 2007918 2006f40: 90 17 61 6c or %i5, 0x16c, %o0 ! 201896c if (result != 0) { 2006f44: b8 92 20 00 orcc %o0, 0, %i4 2006f48: 02 80 00 06 be 2006f60 <== ALWAYS TAKEN 2006f4c: 01 00 00 00 nop free (req); 2006f50: 7f ff f1 72 call 2003518 <== NOT EXECUTED 2006f54: 90 10 00 18 mov %i0, %o0 <== NOT EXECUTED return result; 2006f58: 81 c7 e0 08 ret <== NOT EXECUTED 2006f5c: 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); 2006f60: 40 00 04 73 call 200812c 2006f64: ba 17 61 6c or %i5, 0x16c, %i5 2006f68: 92 07 bf fc add %fp, -4, %o1 2006f6c: 40 00 03 7c call 2007d5c 2006f70: 94 07 bf dc add %fp, -36, %o2 req->caller_thread = pthread_self (); 2006f74: 40 00 04 6e call 200812c 2006f78: 01 00 00 00 nop req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2006f7c: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 2006f80: c6 07 bf dc ld [ %fp + -36 ], %g3 2006f84: 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 (); 2006f88: d0 26 20 10 st %o0, [ %i0 + 0x10 ] req->priority = param.sched_priority - req->aiocbp->aio_reqprio; 2006f8c: 84 20 c0 02 sub %g3, %g2, %g2 2006f90: c4 26 20 0c st %g2, [ %i0 + 0xc ] req->policy = policy; 2006f94: c4 07 bf fc ld [ %fp + -4 ], %g2 2006f98: c4 26 20 08 st %g2, [ %i0 + 8 ] req->aiocbp->error_code = EINPROGRESS; 2006f9c: 84 10 20 77 mov 0x77, %g2 2006fa0: c4 20 60 34 st %g2, [ %g1 + 0x34 ] req->aiocbp->return_value = 0; if ((aio_request_queue.idle_threads == 0) && 2006fa4: 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; 2006fa8: c0 20 60 38 clr [ %g1 + 0x38 ] if ((aio_request_queue.idle_threads == 0) && 2006fac: 80 a0 a0 00 cmp %g2, 0 2006fb0: 12 80 00 33 bne 200707c <== NEVER TAKEN 2006fb4: d2 00 40 00 ld [ %g1 ], %o1 2006fb8: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 2006fbc: 80 a0 60 04 cmp %g1, 4 2006fc0: 14 80 00 30 bg 2007080 2006fc4: 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); 2006fc8: 90 07 60 48 add %i5, 0x48, %o0 2006fcc: 7f ff fe c4 call 2006adc 2006fd0: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 2006fd4: 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); 2006fd8: b6 10 00 08 mov %o0, %i3 if (r_chain->new_fd == 1) { 2006fdc: 80 a0 60 01 cmp %g1, 1 2006fe0: 12 80 00 1d bne 2007054 2006fe4: 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); 2006fe8: 90 10 00 1a mov %i2, %o0 2006fec: 40 00 08 cc call 200931c <_Chain_Insert> 2006ff0: 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); 2006ff4: 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; 2006ff8: c0 26 e0 18 clr [ %i3 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 2006ffc: 40 00 01 f1 call 20077c0 2007000: 92 10 20 00 clr %o1 pthread_cond_init (&r_chain->cond, NULL); 2007004: 90 06 e0 20 add %i3, 0x20, %o0 2007008: 40 00 00 fa call 20073f0 200700c: 92 10 20 00 clr %o1 AIO_printf ("New thread \n"); result = pthread_create (&thid, &aio_request_queue.attr, 2007010: 96 10 00 1b mov %i3, %o3 2007014: 90 07 bf f8 add %fp, -8, %o0 2007018: 92 07 60 08 add %i5, 8, %o1 200701c: 15 00 80 1a sethi %hi(0x2006800), %o2 2007020: 40 00 02 bf call 2007b1c 2007024: 94 12 a3 c8 or %o2, 0x3c8, %o2 ! 2006bc8 rtems_aio_handle, (void *) r_chain); if (result != 0) { 2007028: b6 92 20 00 orcc %o0, 0, %i3 200702c: 22 80 00 07 be,a 2007048 <== ALWAYS TAKEN 2007030: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 pthread_mutex_unlock (&aio_request_queue.mutex); 2007034: 90 10 00 1d mov %i5, %o0 <== NOT EXECUTED 2007038: 40 00 02 58 call 2007998 <== NOT EXECUTED 200703c: b8 10 00 1b mov %i3, %i4 <== NOT EXECUTED return result; 2007040: 81 c7 e0 08 ret <== NOT EXECUTED 2007044: 91 e8 00 1c restore %g0, %i4, %o0 <== NOT EXECUTED } ++aio_request_queue.active_threads; 2007048: 82 00 60 01 inc %g1 200704c: 10 80 00 40 b 200714c 2007050: c2 27 60 64 st %g1, [ %i5 + 0x64 ] } else { /* put request in the fd chain it belongs to */ pthread_mutex_lock (&r_chain->mutex); 2007054: ba 02 20 1c add %o0, 0x1c, %i5 2007058: 40 00 02 30 call 2007918 200705c: 90 10 00 1d mov %i5, %o0 rtems_aio_insert_prio (&r_chain->perfd, req); 2007060: 90 10 00 1a mov %i2, %o0 2007064: 7f ff ff 6d call 2006e18 2007068: 92 10 00 18 mov %i0, %o1 pthread_cond_signal (&r_chain->cond); 200706c: 40 00 01 10 call 20074ac 2007070: 90 06 e0 20 add %i3, 0x20, %o0 pthread_mutex_unlock (&r_chain->mutex); 2007074: 10 80 00 11 b 20070b8 2007078: 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, 200707c: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 2007080: 94 10 20 00 clr %o2 2007084: 7f ff fe 96 call 2006adc 2007088: 90 12 21 b4 or %o0, 0x1b4, %o0 req->aiocbp->aio_fildes, 0); if (r_chain != NULL) 200708c: ba 92 20 00 orcc %o0, 0, %i5 2007090: 02 80 00 0e be 20070c8 2007094: b6 07 60 1c add %i5, 0x1c, %i3 { pthread_mutex_lock (&r_chain->mutex); 2007098: 40 00 02 20 call 2007918 200709c: 90 10 00 1b mov %i3, %o0 rtems_aio_insert_prio (&r_chain->perfd, req); 20070a0: 90 07 60 08 add %i5, 8, %o0 20070a4: 7f ff ff 5d call 2006e18 20070a8: 92 10 00 18 mov %i0, %o1 pthread_cond_signal (&r_chain->cond); 20070ac: 40 00 01 00 call 20074ac 20070b0: 90 07 60 20 add %i5, 0x20, %o0 pthread_mutex_unlock (&r_chain->mutex); 20070b4: 90 10 00 1b mov %i3, %o0 20070b8: 40 00 02 38 call 2007998 20070bc: 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); 20070c0: 10 80 00 24 b 2007150 20070c4: 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); 20070c8: c2 06 20 14 ld [ %i0 + 0x14 ], %g1 20070cc: 11 00 80 62 sethi %hi(0x2018800), %o0 20070d0: d2 00 40 00 ld [ %g1 ], %o1 20070d4: 90 12 21 c0 or %o0, 0x1c0, %o0 20070d8: 7f ff fe 81 call 2006adc 20070dc: 94 10 20 01 mov 1, %o2 if (r_chain->new_fd == 1) { 20070e0: 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); 20070e4: ba 10 00 08 mov %o0, %i5 20070e8: 92 10 00 18 mov %i0, %o1 if (r_chain->new_fd == 1) { 20070ec: 80 a0 60 01 cmp %g1, 1 20070f0: 12 80 00 0d bne 2007124 20070f4: 90 02 20 08 add %o0, 8, %o0 20070f8: 40 00 08 89 call 200931c <_Chain_Insert> 20070fc: 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); 2007100: 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; 2007104: c0 27 60 18 clr [ %i5 + 0x18 ] pthread_mutex_init (&r_chain->mutex, NULL); 2007108: 40 00 01 ae call 20077c0 200710c: 92 10 20 00 clr %o1 pthread_cond_init (&r_chain->cond, NULL); 2007110: 90 07 60 20 add %i5, 0x20, %o0 2007114: 40 00 00 b7 call 20073f0 2007118: 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) 200711c: 10 80 00 05 b 2007130 2007120: 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); 2007124: 7f ff ff 3d call 2006e18 2007128: 01 00 00 00 nop if (aio_request_queue.idle_threads > 0) 200712c: 11 00 80 62 sethi %hi(0x2018800), %o0 2007130: 90 12 21 6c or %o0, 0x16c, %o0 ! 201896c 2007134: c2 02 20 68 ld [ %o0 + 0x68 ], %g1 2007138: 80 a0 60 00 cmp %g1, 0 200713c: 24 80 00 05 ble,a 2007150 <== ALWAYS TAKEN 2007140: 11 00 80 62 sethi %hi(0x2018800), %o0 pthread_cond_signal (&aio_request_queue.new_req); 2007144: 40 00 00 da call 20074ac <== NOT EXECUTED 2007148: 90 02 20 04 add %o0, 4, %o0 ! 2018804 <== NOT EXECUTED } } pthread_mutex_unlock (&aio_request_queue.mutex); 200714c: 11 00 80 62 sethi %hi(0x2018800), %o0 2007150: 40 00 02 12 call 2007998 2007154: 90 12 21 6c or %o0, 0x16c, %o0 ! 201896c return 0; } 2007158: b0 10 00 1c mov %i4, %i0 200715c: 81 c7 e0 08 ret 2007160: 81 e8 00 00 restore =============================================================================== 02006bc8 : * NULL - if error */ static void * rtems_aio_handle (void *arg) { 2006bc8: 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); 2006bcc: 3b 00 80 62 sethi %hi(0x2018800), %i5 default: result = -1; } if (result == -1) { req->aiocbp->return_value = -1; 2006bd0: 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); 2006bd4: ba 17 61 6c or %i5, 0x16c, %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)) { 2006bd8: 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, 2006bdc: 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); 2006be0: a0 06 20 1c add %i0, 0x1c, %l0 2006be4: 40 00 03 4d call 2007918 2006be8: 90 10 00 10 mov %l0, %o0 if (result != 0) 2006bec: 80 a2 20 00 cmp %o0, 0 2006bf0: 12 80 00 87 bne 2006e0c <== NEVER TAKEN 2006bf4: 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; 2006bf8: 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)) { 2006bfc: 80 a7 00 01 cmp %i4, %g1 2006c00: 02 80 00 3a be 2006ce8 2006c04: 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); 2006c08: 40 00 05 49 call 200812c 2006c0c: 01 00 00 00 nop 2006c10: 92 07 bf fc add %fp, -4, %o1 2006c14: 40 00 04 52 call 2007d5c 2006c18: 94 07 bf d8 add %fp, -40, %o2 param.sched_priority = req->priority; 2006c1c: c2 07 20 0c ld [ %i4 + 0xc ], %g1 pthread_setschedparam (pthread_self(), req->policy, ¶m); 2006c20: 40 00 05 43 call 200812c 2006c24: c2 27 bf d8 st %g1, [ %fp + -40 ] 2006c28: d2 07 20 08 ld [ %i4 + 8 ], %o1 2006c2c: 40 00 05 44 call 200813c 2006c30: 94 07 bf d8 add %fp, -40, %o2 */ RTEMS_INLINE_ROUTINE void rtems_chain_extract( rtems_chain_node *the_node ) { _Chain_Extract( the_node ); 2006c34: 40 00 09 a2 call 20092bc <_Chain_Extract> 2006c38: 90 10 00 1c mov %i4, %o0 rtems_chain_extract (node); pthread_mutex_unlock (&r_chain->mutex); 2006c3c: 40 00 03 57 call 2007998 2006c40: 90 10 00 10 mov %l0, %o0 switch (req->aiocbp->aio_lio_opcode) { 2006c44: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 2006c48: c4 00 60 30 ld [ %g1 + 0x30 ], %g2 2006c4c: 80 a0 a0 02 cmp %g2, 2 2006c50: 22 80 00 10 be,a 2006c90 2006c54: c4 18 60 08 ldd [ %g1 + 8 ], %g2 2006c58: 80 a0 a0 03 cmp %g2, 3 2006c5c: 02 80 00 15 be 2006cb0 <== NEVER TAKEN 2006c60: 80 a0 a0 01 cmp %g2, 1 2006c64: 32 80 00 19 bne,a 2006cc8 <== NEVER TAKEN 2006c68: f8 07 20 14 ld [ %i4 + 0x14 ], %i4 <== NOT EXECUTED case LIO_READ: AIO_printf ("read\n"); result = pread (req->aiocbp->aio_fildes, 2006c6c: c4 18 60 08 ldd [ %g1 + 8 ], %g2 2006c70: d0 00 40 00 ld [ %g1 ], %o0 2006c74: d2 00 60 10 ld [ %g1 + 0x10 ], %o1 2006c78: d4 00 60 14 ld [ %g1 + 0x14 ], %o2 2006c7c: 96 10 00 02 mov %g2, %o3 2006c80: 40 00 2b 9d call 2011af4 2006c84: 98 10 00 03 mov %g3, %o4 (void *) req->aiocbp->aio_buf, req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; 2006c88: 10 80 00 0d b 2006cbc 2006c8c: 80 a2 3f ff cmp %o0, -1 case LIO_WRITE: AIO_printf ("write\n"); result = pwrite (req->aiocbp->aio_fildes, 2006c90: d0 00 40 00 ld [ %g1 ], %o0 2006c94: d2 00 60 10 ld [ %g1 + 0x10 ], %o1 2006c98: d4 00 60 14 ld [ %g1 + 0x14 ], %o2 2006c9c: 96 10 00 02 mov %g2, %o3 2006ca0: 40 00 2b d3 call 2011bec 2006ca4: 98 10 00 03 mov %g3, %o4 (void *) req->aiocbp->aio_buf, req->aiocbp->aio_nbytes, req->aiocbp->aio_offset); break; 2006ca8: 10 80 00 05 b 2006cbc 2006cac: 80 a2 3f ff cmp %o0, -1 case LIO_SYNC: AIO_printf ("sync\n"); result = fsync (req->aiocbp->aio_fildes); 2006cb0: 40 00 1b b3 call 200db7c <== NOT EXECUTED 2006cb4: d0 00 40 00 ld [ %g1 ], %o0 <== NOT EXECUTED break; default: result = -1; } if (result == -1) { 2006cb8: 80 a2 3f ff cmp %o0, -1 <== NOT EXECUTED 2006cbc: 32 80 00 08 bne,a 2006cdc <== ALWAYS TAKEN 2006cc0: c2 07 20 14 ld [ %i4 + 0x14 ], %g1 req->aiocbp->return_value = -1; 2006cc4: f8 07 20 14 ld [ %i4 + 0x14 ], %i4 <== NOT EXECUTED req->aiocbp->error_code = errno; 2006cc8: 40 00 28 6f call 2010e84 <__errno> <== NOT EXECUTED 2006ccc: f6 27 20 38 st %i3, [ %i4 + 0x38 ] <== NOT EXECUTED 2006cd0: c2 02 00 00 ld [ %o0 ], %g1 <== NOT EXECUTED 2006cd4: 10 bf ff c3 b 2006be0 <== NOT EXECUTED 2006cd8: c2 27 20 34 st %g1, [ %i4 + 0x34 ] <== NOT EXECUTED } else { req->aiocbp->return_value = result; 2006cdc: d0 20 60 38 st %o0, [ %g1 + 0x38 ] req->aiocbp->error_code = 0; 2006ce0: 10 bf ff c0 b 2006be0 2006ce4: 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); 2006ce8: 40 00 03 2c call 2007998 2006cec: 90 10 00 10 mov %l0, %o0 pthread_mutex_lock (&aio_request_queue.mutex); 2006cf0: 40 00 03 0a call 2007918 2006cf4: 90 10 00 1d mov %i5, %o0 if (rtems_chain_is_empty (chain)) 2006cf8: c2 06 20 08 ld [ %i0 + 8 ], %g1 2006cfc: 80 a0 40 1c cmp %g1, %i4 2006d00: 12 80 00 3f bne 2006dfc <== NEVER TAKEN 2006d04: 92 07 bf f4 add %fp, -12, %o1 { clock_gettime (CLOCK_REALTIME, &timeout); 2006d08: 40 00 01 62 call 2007290 2006d0c: 90 10 20 01 mov 1, %o0 timeout.tv_sec += 3; 2006d10: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 2006d14: 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; 2006d18: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 2006d1c: 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; 2006d20: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&r_chain->cond, 2006d24: 90 10 00 1c mov %i4, %o0 2006d28: 92 10 00 1d mov %i5, %o1 2006d2c: 40 00 01 fd call 2007520 2006d30: 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) { 2006d34: 80 a2 20 74 cmp %o0, 0x74 2006d38: 12 80 00 31 bne 2006dfc <== NEVER TAKEN 2006d3c: 01 00 00 00 nop 2006d40: 40 00 09 5f call 20092bc <_Chain_Extract> 2006d44: 90 10 00 18 mov %i0, %o0 rtems_chain_extract (&r_chain->next_fd); pthread_mutex_destroy (&r_chain->mutex); 2006d48: 40 00 02 4f call 2007684 2006d4c: 90 10 00 10 mov %l0, %o0 pthread_cond_destroy (&r_chain->cond); 2006d50: 40 00 01 74 call 2007320 2006d54: 90 10 00 1c mov %i4, %o0 free (r_chain); 2006d58: 7f ff f1 f0 call 2003518 2006d5c: 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)) { 2006d60: c2 07 60 54 ld [ %i5 + 0x54 ], %g1 2006d64: 80 a0 40 19 cmp %g1, %i1 2006d68: 12 80 00 1b bne 2006dd4 2006d6c: 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); 2006d70: 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; 2006d74: 82 00 60 01 inc %g1 2006d78: c2 27 60 68 st %g1, [ %i5 + 0x68 ] --aio_request_queue.active_threads; 2006d7c: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 clock_gettime (CLOCK_REALTIME, &timeout); 2006d80: 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; 2006d84: 82 00 7f ff add %g1, -1, %g1 clock_gettime (CLOCK_REALTIME, &timeout); 2006d88: 40 00 01 42 call 2007290 2006d8c: c2 27 60 64 st %g1, [ %i5 + 0x64 ] timeout.tv_sec += 3; 2006d90: c2 07 bf f4 ld [ %fp + -12 ], %g1 timeout.tv_nsec = 0; 2006d94: 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; 2006d98: 82 00 60 03 add %g1, 3, %g1 timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 2006d9c: 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; 2006da0: c2 27 bf f4 st %g1, [ %fp + -12 ] timeout.tv_nsec = 0; result = pthread_cond_timedwait (&aio_request_queue.new_req, 2006da4: 92 10 00 1d mov %i5, %o1 2006da8: 40 00 01 de call 2007520 2006dac: 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) { 2006db0: 80 a2 20 74 cmp %o0, 0x74 2006db4: 12 80 00 08 bne 2006dd4 <== NEVER TAKEN 2006db8: c2 07 60 68 ld [ %i5 + 0x68 ], %g1 AIO_printf ("Etimeout\n"); --aio_request_queue.idle_threads; pthread_mutex_unlock (&aio_request_queue.mutex); 2006dbc: 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; 2006dc0: 82 00 7f ff add %g1, -1, %g1 pthread_mutex_unlock (&aio_request_queue.mutex); 2006dc4: 40 00 02 f5 call 2007998 2006dc8: c2 27 60 68 st %g1, [ %i5 + 0x68 ] return NULL; 2006dcc: 81 c7 e0 08 ret 2006dd0: 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; 2006dd4: 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; 2006dd8: 82 00 7f ff add %g1, -1, %g1 2006ddc: c2 27 60 68 st %g1, [ %i5 + 0x68 ] ++aio_request_queue.active_threads; 2006de0: c2 07 60 64 ld [ %i5 + 0x64 ], %g1 2006de4: 90 10 00 18 mov %i0, %o0 2006de8: 82 00 60 01 inc %g1 2006dec: 40 00 09 34 call 20092bc <_Chain_Extract> 2006df0: 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); 2006df4: 7f ff ff 65 call 2006b88 2006df8: 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); 2006dfc: 40 00 02 e7 call 2007998 2006e00: 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); 2006e04: 10 bf ff 78 b 2006be4 2006e08: a0 06 20 1c add %i0, 0x1c, %l0 } } AIO_printf ("Thread finished\n"); return NULL; } 2006e0c: b0 10 20 00 clr %i0 <== NOT EXECUTED 2006e10: 81 c7 e0 08 ret <== NOT EXECUTED 2006e14: 81 e8 00 00 restore <== NOT EXECUTED =============================================================================== 020069fc : * 0 - if initialization succeeded */ int rtems_aio_init (void) { 20069fc: 9d e3 bf a0 save %sp, -96, %sp int result = 0; result = pthread_attr_init (&aio_request_queue.attr); 2006a00: 3b 00 80 62 sethi %hi(0x2018800), %i5 2006a04: 40 00 04 2c call 2007ab4 2006a08: 90 17 61 74 or %i5, 0x174, %o0 ! 2018974 if (result != 0) 2006a0c: b0 92 20 00 orcc %o0, 0, %i0 2006a10: 12 80 00 31 bne 2006ad4 <== NEVER TAKEN 2006a14: 90 17 61 74 or %i5, 0x174, %o0 return result; result = 2006a18: 40 00 04 33 call 2007ae4 2006a1c: 92 10 20 00 clr %o1 pthread_attr_setdetachstate (&aio_request_queue.attr, PTHREAD_CREATE_DETACHED); if (result != 0) 2006a20: 80 a2 20 00 cmp %o0, 0 2006a24: 22 80 00 05 be,a 2006a38 <== ALWAYS TAKEN 2006a28: 11 00 80 62 sethi %hi(0x2018800), %o0 pthread_attr_destroy (&aio_request_queue.attr); 2006a2c: 40 00 04 16 call 2007a84 <== NOT EXECUTED 2006a30: 90 17 61 74 or %i5, 0x174, %o0 <== NOT EXECUTED result = pthread_mutex_init (&aio_request_queue.mutex, NULL); 2006a34: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 2006a38: 92 10 20 00 clr %o1 2006a3c: 40 00 03 61 call 20077c0 2006a40: 90 12 21 6c or %o0, 0x16c, %o0 if (result != 0) 2006a44: 80 a2 20 00 cmp %o0, 0 2006a48: 22 80 00 06 be,a 2006a60 <== ALWAYS TAKEN 2006a4c: 11 00 80 62 sethi %hi(0x2018800), %o0 pthread_attr_destroy (&aio_request_queue.attr); 2006a50: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 2006a54: 40 00 04 0c call 2007a84 <== NOT EXECUTED 2006a58: 90 12 21 74 or %o0, 0x174, %o0 ! 2018974 <== NOT EXECUTED result = pthread_cond_init (&aio_request_queue.new_req, NULL); 2006a5c: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 2006a60: 92 10 20 00 clr %o1 2006a64: 40 00 02 63 call 20073f0 2006a68: 90 12 21 70 or %o0, 0x170, %o0 if (result != 0) { 2006a6c: b0 92 20 00 orcc %o0, 0, %i0 2006a70: 02 80 00 09 be 2006a94 <== ALWAYS TAKEN 2006a74: 03 00 80 62 sethi %hi(0x2018800), %g1 pthread_mutex_destroy (&aio_request_queue.mutex); 2006a78: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 2006a7c: 40 00 03 02 call 2007684 <== NOT EXECUTED 2006a80: 90 12 21 6c or %o0, 0x16c, %o0 ! 201896c <== NOT EXECUTED pthread_attr_destroy (&aio_request_queue.attr); 2006a84: 11 00 80 62 sethi %hi(0x2018800), %o0 <== NOT EXECUTED 2006a88: 40 00 03 ff call 2007a84 <== NOT EXECUTED 2006a8c: 90 12 21 74 or %o0, 0x174, %o0 ! 2018974 <== NOT EXECUTED ) { Chain_Node *head = _Chain_Head( the_chain ); Chain_Node *tail = _Chain_Tail( the_chain ); head->next = tail; 2006a90: 03 00 80 62 sethi %hi(0x2018800), %g1 <== NOT EXECUTED 2006a94: 82 10 61 6c or %g1, 0x16c, %g1 ! 201896c 2006a98: 84 00 60 4c add %g1, 0x4c, %g2 2006a9c: c4 20 60 48 st %g2, [ %g1 + 0x48 ] head->previous = NULL; tail->previous = head; 2006aa0: 84 00 60 48 add %g1, 0x48, %g2 2006aa4: 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; 2006aa8: 84 00 60 58 add %g1, 0x58, %g2 2006aac: c4 20 60 54 st %g2, [ %g1 + 0x54 ] head->previous = NULL; tail->previous = head; 2006ab0: 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; 2006ab4: c0 20 60 4c clr [ %g1 + 0x4c ] tail->previous = head; 2006ab8: 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; 2006abc: 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; 2006ac0: 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; 2006ac4: c0 20 60 64 clr [ %g1 + 0x64 ] aio_request_queue.idle_threads = 0; aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 2006ac8: 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; 2006acc: c0 20 60 68 clr [ %g1 + 0x68 ] aio_request_queue.initialized = AIO_QUEUE_INITIALIZED; 2006ad0: c4 20 60 60 st %g2, [ %g1 + 0x60 ] return result; } 2006ad4: 81 c7 e0 08 ret 2006ad8: 81 e8 00 00 restore =============================================================================== 02006e18 : * NONE */ void rtems_aio_insert_prio (rtems_chain_control *chain, rtems_aio_request *req) { 2006e18: 9d e3 bf a0 save %sp, -96, %sp 2006e1c: 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 ); 2006e20: 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)) { 2006e24: 80 a0 40 03 cmp %g1, %g3 2006e28: 02 80 00 10 be 2006e68 <== NEVER TAKEN 2006e2c: 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; 2006e30: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 while (req->aiocbp->aio_reqprio > prio && 2006e34: 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; 2006e38: c8 01 20 18 ld [ %g4 + 0x18 ], %g4 while (req->aiocbp->aio_reqprio > prio && 2006e3c: 10 80 00 04 b 2006e4c 2006e40: 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; 2006e44: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 <== NOT EXECUTED 2006e48: 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 && 2006e4c: 80 a3 c0 04 cmp %o7, %g4 2006e50: 04 80 00 04 ble 2006e60 <== ALWAYS TAKEN 2006e54: 80 a0 40 03 cmp %g1, %g3 2006e58: 32 bf ff fb bne,a 2006e44 <== NOT EXECUTED 2006e5c: 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 ); 2006e60: f0 00 60 04 ld [ %g1 + 4 ], %i0 2006e64: b2 10 00 02 mov %g2, %i1 2006e68: 40 00 09 2d call 200931c <_Chain_Insert> 2006e6c: 81 e8 00 00 restore =============================================================================== 02006b88 : */ RTEMS_INLINE_ROUTINE Chain_Node *_Chain_First( Chain_Control *the_chain ) { return _Chain_Head( the_chain )->next; 2006b88: 05 00 80 62 sethi %hi(0x2018800), %g2 * NONE */ void rtems_aio_move_to_work (rtems_aio_request_chain *r_chain) { 2006b8c: 92 10 00 08 mov %o0, %o1 2006b90: 84 10 a1 6c or %g2, 0x16c, %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 && 2006b94: 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; 2006b98: c2 00 a0 48 ld [ %g2 + 0x48 ], %g1 2006b9c: 84 00 a0 4c add %g2, 0x4c, %g2 while (temp->fildes < r_chain->fildes && 2006ba0: c8 00 60 14 ld [ %g1 + 0x14 ], %g4 2006ba4: 80 a1 00 03 cmp %g4, %g3 2006ba8: 16 80 00 04 bge 2006bb8 2006bac: 80 a0 40 02 cmp %g1, %g2 2006bb0: 32 bf ff fc bne,a 2006ba0 <== ALWAYS TAKEN 2006bb4: c2 00 40 00 ld [ %g1 ], %g1 2006bb8: d0 00 60 04 ld [ %g1 + 4 ], %o0 2006bbc: 82 13 c0 00 mov %o7, %g1 2006bc0: 40 00 09 d7 call 200931c <_Chain_Insert> 2006bc4: 9e 10 40 00 mov %g1, %o7 =============================================================================== 02006ec0 : * 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) { 2006ec0: 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; 2006ec4: 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 ); 2006ec8: 82 06 20 04 add %i0, 4, %g1 if (rtems_chain_is_empty (chain)) 2006ecc: 80 a7 40 01 cmp %i5, %g1 2006ed0: 12 80 00 05 bne 2006ee4 2006ed4: b0 10 20 02 mov 2, %i0 2006ed8: 81 c7 e0 08 ret 2006edc: 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) { 2006ee0: 80 a7 40 01 cmp %i5, %g1 <== NOT EXECUTED 2006ee4: 02 80 00 12 be 2006f2c <== NEVER TAKEN 2006ee8: 01 00 00 00 nop 2006eec: c4 07 60 14 ld [ %i5 + 0x14 ], %g2 2006ef0: 80 a0 80 19 cmp %g2, %i1 2006ef4: 32 bf ff fb bne,a 2006ee0 <== NEVER TAKEN 2006ef8: fa 07 40 00 ld [ %i5 ], %i5 <== NOT EXECUTED 2006efc: 40 00 08 f0 call 20092bc <_Chain_Extract> 2006f00: 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; 2006f04: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2006f08: 84 10 20 8c mov 0x8c, %g2 2006f0c: c4 20 60 34 st %g2, [ %g1 + 0x34 ] current->aiocbp->return_value = -1; 2006f10: 84 10 3f ff mov -1, %g2 free (current); 2006f14: 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; 2006f18: c4 20 60 38 st %g2, [ %g1 + 0x38 ] free (current); 2006f1c: 7f ff f1 7f call 2003518 2006f20: b0 10 20 00 clr %i0 } return AIO_CANCELED; 2006f24: 81 c7 e0 08 ret 2006f28: 81 e8 00 00 restore } 2006f2c: 81 c7 e0 08 ret <== NOT EXECUTED 2006f30: 91 e8 20 01 restore %g0, 1, %o0 <== NOT EXECUTED =============================================================================== 02006cb4 : rtems_chain_control *chain, rtems_event_set events, rtems_interval timeout, rtems_chain_node **node_ptr ) { 2006cb4: 9d e3 bf 98 save %sp, -104, %sp 2006cb8: 10 80 00 09 b 2006cdc 2006cbc: 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( 2006cc0: 92 10 20 00 clr %o1 2006cc4: 94 10 00 1a mov %i2, %o2 2006cc8: 7f ff fd 03 call 20060d4 2006ccc: 96 07 bf fc add %fp, -4, %o3 ) { rtems_status_code sc = RTEMS_SUCCESSFUL; rtems_chain_node *node = NULL; while ( 2006cd0: 80 a2 20 00 cmp %o0, 0 2006cd4: 32 80 00 09 bne,a 2006cf8 <== ALWAYS TAKEN 2006cd8: 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 ); 2006cdc: 40 00 01 7a call 20072c4 <_Chain_Get> 2006ce0: 90 10 00 1d mov %i5, %o0 sc == RTEMS_SUCCESSFUL && (node = rtems_chain_get( chain )) == NULL 2006ce4: b8 92 20 00 orcc %o0, 0, %i4 2006ce8: 02 bf ff f6 be 2006cc0 2006cec: 90 10 00 19 mov %i1, %o0 2006cf0: 90 10 20 00 clr %o0 timeout, &out ); } *node_ptr = node; 2006cf4: f8 26 c0 00 st %i4, [ %i3 ] return sc; } 2006cf8: 81 c7 e0 08 ret 2006cfc: 91 e8 00 08 restore %g0, %o0, %o0 =============================================================================== 02008fa4 : #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) { 2008fa4: 9d e3 bf a0 save %sp, -96, %sp uint32_t i; uint32_t api_index; Thread_Control *the_thread; Objects_Information *information; if ( !routine ) 2008fa8: 80 a6 20 00 cmp %i0, 0 2008fac: 02 80 00 1b be 2009018 <== NEVER TAKEN 2008fb0: 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 ]; 2008fb4: 35 00 80 7c sethi %hi(0x201f000), %i2 #endif #include #include void rtems_iterate_over_all_threads(rtems_per_thread_routine routine) 2008fb8: 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 ]; 2008fbc: 84 16 a3 98 or %i2, 0x398, %g2 2008fc0: c2 00 80 01 ld [ %g2 + %g1 ], %g1 2008fc4: f6 00 60 04 ld [ %g1 + 4 ], %i3 if ( !information ) 2008fc8: 80 a6 e0 00 cmp %i3, 0 2008fcc: 12 80 00 0b bne 2008ff8 2008fd0: b8 10 20 01 mov 1, %i4 Objects_Information *information; if ( !routine ) return; for ( api_index = 1 ; api_index <= OBJECTS_APIS_LAST ; api_index++ ) { 2008fd4: 10 80 00 0e b 200900c 2008fd8: 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 ]; 2008fdc: 83 2f 20 02 sll %i4, 2, %g1 2008fe0: d0 00 80 01 ld [ %g2 + %g1 ], %o0 if ( !the_thread ) 2008fe4: 80 a2 20 00 cmp %o0, 0 2008fe8: 02 80 00 04 be 2008ff8 2008fec: b8 07 20 01 inc %i4 continue; (*routine)(the_thread); 2008ff0: 9f c6 00 00 call %i0 2008ff4: 01 00 00 00 nop information = _Objects_Information_table[ api_index ][ 1 ]; if ( !information ) continue; for ( i=1 ; i <= information->maximum ; i++ ) { 2008ff8: c2 16 e0 10 lduh [ %i3 + 0x10 ], %g1 2008ffc: 80 a7 00 01 cmp %i4, %g1 2009000: 28 bf ff f7 bleu,a 2008fdc 2009004: 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++ ) { 2009008: ba 07 60 01 inc %i5 200900c: 80 a7 60 04 cmp %i5, 4 2009010: 12 bf ff eb bne 2008fbc 2009014: 83 2f 60 02 sll %i5, 2, %g1 2009018: 81 c7 e0 08 ret 200901c: 81 e8 00 00 restore =============================================================================== 0201471c : uint32_t length, uint32_t buffer_size, rtems_attribute attribute_set, rtems_id *id ) { 201471c: 9d e3 bf a0 save %sp, -96, %sp register Partition_Control *the_partition; if ( !rtems_is_name_valid( name ) ) 2014720: 80 a6 20 00 cmp %i0, 0 2014724: 02 80 00 39 be 2014808 2014728: 82 10 20 03 mov 3, %g1 return RTEMS_INVALID_NAME; if ( !starting_address ) 201472c: 80 a6 60 00 cmp %i1, 0 2014730: 02 80 00 36 be 2014808 2014734: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; if ( !id ) 2014738: 80 a7 60 00 cmp %i5, 0 201473c: 02 80 00 33 be 2014808 <== NEVER TAKEN 2014740: 80 a6 e0 00 cmp %i3, 0 return RTEMS_INVALID_ADDRESS; if ( length == 0 || buffer_size == 0 || length < buffer_size || 2014744: 02 80 00 31 be 2014808 2014748: 82 10 20 08 mov 8, %g1 201474c: 80 a6 a0 00 cmp %i2, 0 2014750: 02 80 00 2e be 2014808 2014754: 80 a6 80 1b cmp %i2, %i3 2014758: 0a 80 00 2c bcs 2014808 201475c: 80 8e e0 07 btst 7, %i3 2014760: 12 80 00 2a bne 2014808 2014764: 80 8e 60 07 btst 7, %i1 !_Partition_Is_buffer_size_aligned( buffer_size ) ) return RTEMS_INVALID_SIZE; if ( !_Addresses_Is_aligned( starting_address ) ) 2014768: 12 80 00 28 bne 2014808 201476c: 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++; 2014770: 03 00 80 f6 sethi %hi(0x203d800), %g1 2014774: c4 00 60 70 ld [ %g1 + 0x70 ], %g2 ! 203d870 <_Thread_Dispatch_disable_level> 2014778: 84 00 a0 01 inc %g2 201477c: c4 20 60 70 st %g2, [ %g1 + 0x70 ] return _Thread_Dispatch_disable_level; 2014780: c2 00 60 70 ld [ %g1 + 0x70 ], %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 ); 2014784: 23 00 80 f5 sethi %hi(0x203d400), %l1 2014788: 40 00 12 6e call 2019140 <_Objects_Allocate> 201478c: 90 14 62 84 or %l1, 0x284, %o0 ! 203d684 <_Partition_Information> _Thread_Disable_dispatch(); /* prevents deletion */ the_partition = _Partition_Allocate(); if ( !the_partition ) { 2014790: a0 92 20 00 orcc %o0, 0, %l0 2014794: 32 80 00 06 bne,a 20147ac 2014798: f8 24 20 1c st %i4, [ %l0 + 0x1c ] _Thread_Enable_dispatch(); 201479c: 40 00 17 3f call 201a498 <_Thread_Enable_dispatch> 20147a0: 01 00 00 00 nop return RTEMS_TOO_MANY; 20147a4: 10 80 00 19 b 2014808 20147a8: 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 ); 20147ac: 92 10 00 1b mov %i3, %o1 _Thread_Enable_dispatch(); return RTEMS_TOO_MANY; } #endif the_partition->starting_address = starting_address; 20147b0: f2 24 20 10 st %i1, [ %l0 + 0x10 ] the_partition->length = length; 20147b4: f4 24 20 14 st %i2, [ %l0 + 0x14 ] the_partition->buffer_size = buffer_size; 20147b8: f6 24 20 18 st %i3, [ %l0 + 0x18 ] the_partition->attribute_set = attribute_set; the_partition->number_of_used_blocks = 0; 20147bc: c0 24 20 20 clr [ %l0 + 0x20 ] _Chain_Initialize( &the_partition->Memory, starting_address, length / buffer_size, buffer_size ); 20147c0: 40 00 62 89 call 202d1e4 <.udiv> 20147c4: 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, 20147c8: 92 10 00 19 mov %i1, %o1 length / buffer_size, buffer_size ); 20147cc: 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, 20147d0: 96 10 00 1b mov %i3, %o3 20147d4: b8 04 20 24 add %l0, 0x24, %i4 20147d8: 40 00 0c 63 call 2017964 <_Chain_Initialize> 20147dc: 90 10 00 1c mov %i4, %o0 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 20147e0: c4 14 20 0a lduh [ %l0 + 0xa ], %g2 ); #endif _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } 20147e4: a2 14 62 84 or %l1, 0x284, %l1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20147e8: c6 04 60 1c ld [ %l1 + 0x1c ], %g3 Objects_Information *information, Objects_Control *the_object, Objects_Name name ) { _Objects_Set_local_object( 20147ec: c2 04 20 08 ld [ %l0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 20147f0: 85 28 a0 02 sll %g2, 2, %g2 20147f4: e0 20 c0 02 st %l0, [ %g3 + %g2 ] information, _Objects_Get_index( the_object->id ), the_object ); the_object->name = name; 20147f8: f0 24 20 0c st %i0, [ %l0 + 0xc ] name, 0 /* Not used */ ); #endif _Thread_Enable_dispatch(); 20147fc: 40 00 17 27 call 201a498 <_Thread_Enable_dispatch> 2014800: c2 27 40 00 st %g1, [ %i5 ] return RTEMS_SUCCESSFUL; 2014804: 82 10 20 00 clr %g1 } 2014808: 81 c7 e0 08 ret 201480c: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 020071b4 : rtems_status_code rtems_rate_monotonic_period( rtems_id id, rtems_interval length ) { 20071b4: 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 *) 20071b8: 11 00 80 79 sethi %hi(0x201e400), %o0 20071bc: 92 10 00 18 mov %i0, %o1 20071c0: 90 12 22 44 or %o0, 0x244, %o0 20071c4: 40 00 08 f7 call 20095a0 <_Objects_Get> 20071c8: 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 ) { 20071cc: c2 07 bf fc ld [ %fp + -4 ], %g1 20071d0: 80 a0 60 00 cmp %g1, 0 20071d4: 12 80 00 65 bne 2007368 20071d8: ba 10 00 08 mov %o0, %i5 RTEMS_INLINE_ROUTINE bool _Thread_Is_executing ( const Thread_Control *the_thread ) { return ( the_thread == _Thread_Executing ); 20071dc: 37 00 80 7b sethi %hi(0x201ec00), %i3 case OBJECTS_LOCAL: if ( !_Thread_Is_executing( the_period->owner ) ) { 20071e0: c4 02 20 40 ld [ %o0 + 0x40 ], %g2 20071e4: b6 16 e0 e8 or %i3, 0xe8, %i3 20071e8: c2 06 e0 0c ld [ %i3 + 0xc ], %g1 20071ec: 80 a0 80 01 cmp %g2, %g1 20071f0: 02 80 00 06 be 2007208 20071f4: 80 a6 60 00 cmp %i1, 0 _Thread_Enable_dispatch(); 20071f8: 40 00 0c 75 call 200a3cc <_Thread_Enable_dispatch> 20071fc: b0 10 20 17 mov 0x17, %i0 return RTEMS_NOT_OWNER_OF_RESOURCE; 2007200: 81 c7 e0 08 ret 2007204: 81 e8 00 00 restore } if ( length == RTEMS_PERIOD_STATUS ) { 2007208: 12 80 00 0d bne 200723c 200720c: 01 00 00 00 nop switch ( the_period->state ) { 2007210: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 2007214: 80 a0 60 04 cmp %g1, 4 2007218: 18 80 00 05 bgu 200722c <== NEVER TAKEN 200721c: b0 10 20 00 clr %i0 case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 2007220: 05 00 80 71 sethi %hi(0x201c400), %g2 2007224: 84 10 a0 50 or %g2, 0x50, %g2 ! 201c450 2007228: 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(); 200722c: 40 00 0c 68 call 200a3cc <_Thread_Enable_dispatch> 2007230: 01 00 00 00 nop return( return_value ); 2007234: 81 c7 e0 08 ret 2007238: 81 e8 00 00 restore } _ISR_Disable( level ); 200723c: 7f ff ee fd call 2002e30 2007240: 01 00 00 00 nop 2007244: b4 10 00 08 mov %o0, %i2 if ( the_period->state == RATE_MONOTONIC_INACTIVE ) { 2007248: f8 07 60 38 ld [ %i5 + 0x38 ], %i4 200724c: 80 a7 20 00 cmp %i4, 0 2007250: 12 80 00 15 bne 20072a4 2007254: 80 a7 20 02 cmp %i4, 2 _ISR_Enable( level ); 2007258: 7f ff ee fa call 2002e40 200725c: 01 00 00 00 nop /* * Baseline statistics information for the beginning of a period. */ _Rate_monotonic_Initiate_statistics( the_period ); 2007260: 7f ff ff 7f call 200705c <_Rate_monotonic_Initiate_statistics> 2007264: 90 10 00 1d mov %i5, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 2007268: 82 10 20 02 mov 2, %g1 200726c: c2 27 60 38 st %g1, [ %i5 + 0x38 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2007270: 03 00 80 1d sethi %hi(0x2007400), %g1 2007274: 82 10 62 24 or %g1, 0x224, %g1 ! 2007624 <_Rate_monotonic_Timeout> Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2007278: c0 27 60 18 clr [ %i5 + 0x18 ] the_watchdog->routine = routine; 200727c: c2 27 60 2c st %g1, [ %i5 + 0x2c ] the_watchdog->id = id; 2007280: f0 27 60 30 st %i0, [ %i5 + 0x30 ] the_watchdog->user_data = user_data; 2007284: c0 27 60 34 clr [ %i5 + 0x34 ] _Rate_monotonic_Timeout, id, NULL ); the_period->next_length = length; 2007288: f2 27 60 3c st %i1, [ %i5 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200728c: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007290: 11 00 80 7a sethi %hi(0x201e800), %o0 2007294: 92 07 60 10 add %i5, 0x10, %o1 2007298: 40 00 10 50 call 200b3d8 <_Watchdog_Insert> 200729c: 90 12 20 74 or %o0, 0x74, %o0 20072a0: 30 80 00 1b b,a 200730c _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); return RTEMS_SUCCESSFUL; } if ( the_period->state == RATE_MONOTONIC_ACTIVE ) { 20072a4: 12 80 00 1e bne 200731c 20072a8: 80 a7 20 04 cmp %i4, 4 /* * Update statistics from the concluding period. */ _Rate_monotonic_Update_statistics( the_period ); 20072ac: 7f ff ff 86 call 20070c4 <_Rate_monotonic_Update_statistics> 20072b0: 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; 20072b4: 82 10 20 01 mov 1, %g1 the_period->next_length = length; 20072b8: 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; 20072bc: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; _ISR_Enable( level ); 20072c0: 7f ff ee e0 call 2002e40 20072c4: 90 10 00 1a mov %i2, %o0 _Thread_Executing->Wait.id = the_period->Object.id; 20072c8: d0 06 e0 0c ld [ %i3 + 0xc ], %o0 20072cc: c2 07 60 08 ld [ %i5 + 8 ], %g1 _Thread_Set_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 20072d0: 13 00 00 10 sethi %hi(0x4000), %o1 20072d4: 40 00 0e 6c call 200ac84 <_Thread_Set_state> 20072d8: c2 22 20 20 st %g1, [ %o0 + 0x20 ] /* * Did the watchdog timer expire while we were actually blocking * on it? */ _ISR_Disable( level ); 20072dc: 7f ff ee d5 call 2002e30 20072e0: 01 00 00 00 nop local_state = the_period->state; 20072e4: f4 07 60 38 ld [ %i5 + 0x38 ], %i2 the_period->state = RATE_MONOTONIC_ACTIVE; 20072e8: f8 27 60 38 st %i4, [ %i5 + 0x38 ] _ISR_Enable( level ); 20072ec: 7f ff ee d5 call 2002e40 20072f0: 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 ) 20072f4: 80 a6 a0 03 cmp %i2, 3 20072f8: 12 80 00 05 bne 200730c 20072fc: 01 00 00 00 nop _Thread_Clear_state( _Thread_Executing, STATES_WAITING_FOR_PERIOD ); 2007300: d0 06 e0 0c ld [ %i3 + 0xc ], %o0 2007304: 40 00 0b 55 call 200a058 <_Thread_Clear_state> 2007308: 13 00 00 10 sethi %hi(0x4000), %o1 _Thread_Enable_dispatch(); 200730c: 40 00 0c 30 call 200a3cc <_Thread_Enable_dispatch> 2007310: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 2007314: 81 c7 e0 08 ret 2007318: 81 e8 00 00 restore } if ( the_period->state == RATE_MONOTONIC_EXPIRED ) { 200731c: 12 bf ff b9 bne 2007200 <== NEVER TAKEN 2007320: b0 10 20 04 mov 4, %i0 /* * Update statistics from the concluding period */ _Rate_monotonic_Update_statistics( the_period ); 2007324: 7f ff ff 68 call 20070c4 <_Rate_monotonic_Update_statistics> 2007328: 90 10 00 1d mov %i5, %o0 _ISR_Enable( level ); 200732c: 7f ff ee c5 call 2002e40 2007330: 90 10 00 1a mov %i2, %o0 the_period->state = RATE_MONOTONIC_ACTIVE; 2007334: 82 10 20 02 mov 2, %g1 2007338: 92 07 60 10 add %i5, 0x10, %o1 200733c: 11 00 80 7a sethi %hi(0x201e800), %o0 2007340: 90 12 20 74 or %o0, 0x74, %o0 ! 201e874 <_Watchdog_Ticks_chain> 2007344: c2 27 60 38 st %g1, [ %i5 + 0x38 ] the_period->next_length = length; 2007348: f2 27 60 3c st %i1, [ %i5 + 0x3c ] Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 200734c: f2 27 60 1c st %i1, [ %i5 + 0x1c ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2007350: 40 00 10 22 call 200b3d8 <_Watchdog_Insert> 2007354: b0 10 20 06 mov 6, %i0 _Watchdog_Insert_ticks( &the_period->Timer, length ); _Thread_Enable_dispatch(); 2007358: 40 00 0c 1d call 200a3cc <_Thread_Enable_dispatch> 200735c: 01 00 00 00 nop return RTEMS_TIMEOUT; 2007360: 81 c7 e0 08 ret 2007364: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 2007368: b0 10 20 04 mov 4, %i0 } 200736c: 81 c7 e0 08 ret 2007370: 81 e8 00 00 restore =============================================================================== 02007374 : */ void rtems_rate_monotonic_report_statistics_with_plugin( void *context, rtems_printk_plugin_t print ) { 2007374: 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 ) 2007378: 80 a6 60 00 cmp %i1, 0 200737c: 02 80 00 75 be 2007550 <== NEVER TAKEN 2007380: 90 10 00 18 mov %i0, %o0 return; (*print)( context, "Period information by period\n" ); 2007384: 13 00 80 71 sethi %hi(0x201c400), %o1 2007388: 9f c6 40 00 call %i1 200738c: 92 12 60 58 or %o1, 0x58, %o1 ! 201c458 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ (*print)( context, "--- CPU times are in seconds ---\n" ); 2007390: 90 10 00 18 mov %i0, %o0 2007394: 13 00 80 71 sethi %hi(0x201c400), %o1 2007398: 9f c6 40 00 call %i1 200739c: 92 12 60 78 or %o1, 0x78, %o1 ! 201c478 (*print)( context, "--- Wall times are in seconds ---\n" ); 20073a0: 90 10 00 18 mov %i0, %o0 20073a4: 13 00 80 71 sethi %hi(0x201c400), %o1 20073a8: 9f c6 40 00 call %i1 20073ac: 92 12 60 a0 or %o1, 0xa0, %o1 ! 201c4a0 Be sure to test the various cases. (*print)( context,"\ 1234567890123456789012345678901234567890123456789012345678901234567890123456789\ \n"); */ (*print)( context, " ID OWNER COUNT MISSED " 20073b0: 90 10 00 18 mov %i0, %o0 20073b4: 13 00 80 71 sethi %hi(0x201c400), %o1 20073b8: 9f c6 40 00 call %i1 20073bc: 92 12 60 c8 or %o1, 0xc8, %o1 ! 201c4c8 #ifndef __RTEMS_USE_TICKS_FOR_STATISTICS__ " " #endif " WALL TIME\n" ); (*print)( context, " " 20073c0: 90 10 00 18 mov %i0, %o0 20073c4: 13 00 80 71 sethi %hi(0x201c400), %o1 20073c8: 9f c6 40 00 call %i1 20073cc: 92 12 61 18 or %o1, 0x118, %o1 ! 201c518 /* * 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 ; 20073d0: 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, 20073d4: 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, 20073d8: 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, 20073dc: 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" ); 20073e0: 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 ; 20073e4: fa 00 62 4c ld [ %g1 + 0x24c ], %i5 rtems_object_get_name( the_status.owner, sizeof(name), name ); /* * Print part of report line that is not dependent on granularity */ (*print)( context, 20073e8: a0 14 21 68 or %l0, 0x168, %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, 20073ec: b4 16 a1 80 or %i2, 0x180, %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, 20073f0: b6 16 e1 a0 or %i3, 0x1a0, %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 ; 20073f4: 10 80 00 52 b 200753c 20073f8: b8 17 23 68 or %i4, 0x368, %i4 id <= _Rate_monotonic_Information.maximum_id ; id++ ) { status = rtems_rate_monotonic_get_statistics( id, &the_stats ); 20073fc: 40 00 19 be call 200daf4 2007400: 92 07 bf a0 add %fp, -96, %o1 if ( status != RTEMS_SUCCESSFUL ) 2007404: 80 a2 20 00 cmp %o0, 0 2007408: 32 80 00 4d bne,a 200753c 200740c: 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 ); 2007410: 92 07 bf d8 add %fp, -40, %o1 2007414: 40 00 19 e5 call 200dba8 2007418: 90 10 00 1d mov %i5, %o0 #endif rtems_object_get_name( the_status.owner, sizeof(name), name ); 200741c: d0 07 bf d8 ld [ %fp + -40 ], %o0 2007420: 92 10 20 05 mov 5, %o1 2007424: 40 00 00 af call 20076e0 2007428: 94 07 bf f8 add %fp, -8, %o2 /* * Print part of report line that is not dependent on granularity */ (*print)( context, 200742c: d8 1f bf a0 ldd [ %fp + -96 ], %o4 2007430: 92 10 00 10 mov %l0, %o1 2007434: 90 10 00 18 mov %i0, %o0 2007438: 94 10 00 1d mov %i5, %o2 200743c: 9f c6 40 00 call %i1 2007440: 96 07 bf f8 add %fp, -8, %o3 ); /* * If the count is zero, don't print statistics */ if (the_stats.count == 0) { 2007444: d2 07 bf a0 ld [ %fp + -96 ], %o1 2007448: 80 a2 60 00 cmp %o1, 0 200744c: 12 80 00 07 bne 2007468 2007450: 94 07 bf f0 add %fp, -16, %o2 (*print)( context, "\n" ); 2007454: 90 10 00 18 mov %i0, %o0 2007458: 9f c6 40 00 call %i1 200745c: 92 10 00 1c mov %i4, %o1 continue; 2007460: 10 80 00 37 b 200753c 2007464: 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 ); 2007468: 40 00 0e bd call 200af5c <_Timespec_Divide_by_integer> 200746c: 90 07 bf b8 add %fp, -72, %o0 (*print)( context, 2007470: d0 07 bf ac ld [ %fp + -84 ], %o0 2007474: 40 00 47 3a call 201915c <.div> 2007478: 92 10 23 e8 mov 0x3e8, %o1 200747c: a6 10 00 08 mov %o0, %l3 2007480: d0 07 bf b4 ld [ %fp + -76 ], %o0 2007484: 40 00 47 36 call 201915c <.div> 2007488: 92 10 23 e8 mov 0x3e8, %o1 200748c: c2 07 bf f0 ld [ %fp + -16 ], %g1 2007490: a2 10 00 08 mov %o0, %l1 2007494: d0 07 bf f4 ld [ %fp + -12 ], %o0 2007498: e8 07 bf a8 ld [ %fp + -88 ], %l4 200749c: e4 07 bf b0 ld [ %fp + -80 ], %l2 20074a0: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 20074a4: 40 00 47 2e call 201915c <.div> 20074a8: 92 10 23 e8 mov 0x3e8, %o1 20074ac: 96 10 00 13 mov %l3, %o3 20074b0: 98 10 00 12 mov %l2, %o4 20074b4: 9a 10 00 11 mov %l1, %o5 20074b8: 94 10 00 14 mov %l4, %o2 20074bc: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 20074c0: 92 10 00 1a mov %i2, %o1 20074c4: 9f c6 40 00 call %i1 20074c8: 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); 20074cc: d2 07 bf a0 ld [ %fp + -96 ], %o1 20074d0: 94 07 bf f0 add %fp, -16, %o2 20074d4: 40 00 0e a2 call 200af5c <_Timespec_Divide_by_integer> 20074d8: 90 07 bf d0 add %fp, -48, %o0 (*print)( context, 20074dc: d0 07 bf c4 ld [ %fp + -60 ], %o0 20074e0: 40 00 47 1f call 201915c <.div> 20074e4: 92 10 23 e8 mov 0x3e8, %o1 20074e8: a6 10 00 08 mov %o0, %l3 20074ec: d0 07 bf cc ld [ %fp + -52 ], %o0 20074f0: 40 00 47 1b call 201915c <.div> 20074f4: 92 10 23 e8 mov 0x3e8, %o1 20074f8: c2 07 bf f0 ld [ %fp + -16 ], %g1 20074fc: a2 10 00 08 mov %o0, %l1 2007500: d0 07 bf f4 ld [ %fp + -12 ], %o0 2007504: e8 07 bf c0 ld [ %fp + -64 ], %l4 2007508: e4 07 bf c8 ld [ %fp + -56 ], %l2 200750c: 92 10 23 e8 mov 0x3e8, %o1 2007510: 40 00 47 13 call 201915c <.div> 2007514: c2 23 a0 5c st %g1, [ %sp + 0x5c ] 2007518: 92 10 00 1b mov %i3, %o1 200751c: d0 23 a0 60 st %o0, [ %sp + 0x60 ] 2007520: 94 10 00 14 mov %l4, %o2 2007524: 90 10 00 18 mov %i0, %o0 2007528: 96 10 00 13 mov %l3, %o3 200752c: 98 10 00 12 mov %l2, %o4 2007530: 9f c6 40 00 call %i1 2007534: 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++ ) { 2007538: 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 ; 200753c: 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 ; 2007540: c2 00 62 50 ld [ %g1 + 0x250 ], %g1 ! 201e650 <_Rate_monotonic_Information+0xc> 2007544: 80 a7 40 01 cmp %i5, %g1 2007548: 08 bf ff ad bleu 20073fc 200754c: 90 10 00 1d mov %i5, %o0 2007550: 81 c7 e0 08 ret 2007554: 81 e8 00 00 restore =============================================================================== 02015c8c : rtems_status_code rtems_signal_send( rtems_id id, rtems_signal_set signal_set ) { 2015c8c: 9d e3 bf 98 save %sp, -104, %sp 2015c90: 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 ) 2015c94: 80 a6 60 00 cmp %i1, 0 2015c98: 02 80 00 2e be 2015d50 2015c9c: b0 10 20 0a mov 0xa, %i0 return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 2015ca0: 40 00 12 0a call 201a4c8 <_Thread_Get> 2015ca4: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 2015ca8: c2 07 bf fc ld [ %fp + -4 ], %g1 ASR_Information *asr; if ( !signal_set ) return RTEMS_INVALID_NUMBER; the_thread = _Thread_Get( id, &location ); 2015cac: b8 10 00 08 mov %o0, %i4 switch ( location ) { 2015cb0: 80 a0 60 00 cmp %g1, 0 2015cb4: 12 80 00 27 bne 2015d50 2015cb8: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: api = the_thread->API_Extensions[ THREAD_API_RTEMS ]; 2015cbc: fa 02 21 58 ld [ %o0 + 0x158 ], %i5 asr = &api->Signal; if ( ! _ASR_Is_null_handler( asr->handler ) ) { 2015cc0: c2 07 60 0c ld [ %i5 + 0xc ], %g1 2015cc4: 80 a0 60 00 cmp %g1, 0 2015cc8: 02 80 00 24 be 2015d58 2015ccc: 01 00 00 00 nop if ( asr->is_enabled ) { 2015cd0: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 2015cd4: 80 a0 60 00 cmp %g1, 0 2015cd8: 02 80 00 15 be 2015d2c 2015cdc: 01 00 00 00 nop rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 2015ce0: 7f ff e7 d1 call 200fc24 2015ce4: 01 00 00 00 nop *signal_set |= signals; 2015ce8: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 2015cec: b2 10 40 19 or %g1, %i1, %i1 2015cf0: f2 27 60 14 st %i1, [ %i5 + 0x14 ] _ISR_Enable( _level ); 2015cf4: 7f ff e7 d0 call 200fc34 2015cf8: 01 00 00 00 nop _ASR_Post_signals( signal_set, &asr->signals_posted ); if ( _ISR_Is_in_progress() && _Thread_Is_executing( the_thread ) ) 2015cfc: 03 00 80 f7 sethi %hi(0x203dc00), %g1 2015d00: 82 10 61 b0 or %g1, 0x1b0, %g1 ! 203ddb0 <_Per_CPU_Information> 2015d04: c4 00 60 08 ld [ %g1 + 8 ], %g2 2015d08: 80 a0 a0 00 cmp %g2, 0 2015d0c: 02 80 00 0f be 2015d48 2015d10: 01 00 00 00 nop 2015d14: c4 00 60 0c ld [ %g1 + 0xc ], %g2 2015d18: 80 a7 00 02 cmp %i4, %g2 2015d1c: 12 80 00 0b bne 2015d48 <== NEVER TAKEN 2015d20: 84 10 20 01 mov 1, %g2 _Thread_Dispatch_necessary = true; 2015d24: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] 2015d28: 30 80 00 08 b,a 2015d48 rtems_signal_set *signal_set ) { ISR_Level _level; _ISR_Disable( _level ); 2015d2c: 7f ff e7 be call 200fc24 2015d30: 01 00 00 00 nop *signal_set |= signals; 2015d34: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 2015d38: b2 10 40 19 or %g1, %i1, %i1 2015d3c: f2 27 60 18 st %i1, [ %i5 + 0x18 ] _ISR_Enable( _level ); 2015d40: 7f ff e7 bd call 200fc34 2015d44: 01 00 00 00 nop } else { _ASR_Post_signals( signal_set, &asr->signals_pending ); } _Thread_Enable_dispatch(); 2015d48: 40 00 11 d4 call 201a498 <_Thread_Enable_dispatch> 2015d4c: b0 10 20 00 clr %i0 ! 0 return RTEMS_SUCCESSFUL; 2015d50: 81 c7 e0 08 ret 2015d54: 81 e8 00 00 restore } _Thread_Enable_dispatch(); 2015d58: 40 00 11 d0 call 201a498 <_Thread_Enable_dispatch> 2015d5c: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; 2015d60: 81 c7 e0 08 ret 2015d64: 81 e8 00 00 restore =============================================================================== 0200e3b8 : rtems_status_code rtems_task_mode( rtems_mode mode_set, rtems_mode mask, rtems_mode *previous_mode_set ) { 200e3b8: 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 ) 200e3bc: 80 a6 a0 00 cmp %i2, 0 200e3c0: 02 80 00 5a be 200e528 200e3c4: 82 10 20 09 mov 9, %g1 return RTEMS_INVALID_ADDRESS; executing = _Thread_Executing; 200e3c8: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e3cc: f8 00 62 44 ld [ %g1 + 0x244 ], %i4 ! 201ce44 <_Per_CPU_Information+0xc> api = executing->API_Extensions[ THREAD_API_RTEMS ]; asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200e3d0: 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 ]; 200e3d4: fa 07 21 58 ld [ %i4 + 0x158 ], %i5 asr = &api->Signal; old_mode = (executing->is_preemptible) ? RTEMS_PREEMPT : RTEMS_NO_PREEMPT; 200e3d8: 80 a0 00 01 cmp %g0, %g1 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200e3dc: 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; 200e3e0: b6 60 3f ff subx %g0, -1, %i3 if ( executing->budget_algorithm == THREAD_CPU_BUDGET_ALGORITHM_NONE ) 200e3e4: 80 a0 60 00 cmp %g1, 0 200e3e8: 02 80 00 03 be 200e3f4 200e3ec: b7 2e e0 08 sll %i3, 8, %i3 old_mode |= RTEMS_NO_TIMESLICE; else old_mode |= RTEMS_TIMESLICE; 200e3f0: b6 16 e2 00 or %i3, 0x200, %i3 old_mode |= (asr->is_enabled) ? RTEMS_ASR : RTEMS_NO_ASR; 200e3f4: c2 0f 60 08 ldub [ %i5 + 8 ], %g1 200e3f8: 80 a0 00 01 cmp %g0, %g1 old_mode |= _ISR_Get_level(); 200e3fc: 7f ff ee f5 call 2009fd0 <_CPU_ISR_Get_level> 200e400: 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; 200e404: a1 2c 20 0a sll %l0, 0xa, %l0 200e408: a0 14 00 08 or %l0, %o0, %l0 old_mode |= _ISR_Get_level(); 200e40c: b6 14 00 1b or %l0, %i3, %i3 *previous_mode_set = old_mode; /* * These are generic thread scheduling characteristics. */ if ( mask & RTEMS_PREEMPT_MASK ) 200e410: 80 8e 61 00 btst 0x100, %i1 200e414: 02 80 00 06 be 200e42c 200e418: 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; 200e41c: 82 0e 21 00 and %i0, 0x100, %g1 executing->is_preemptible = _Modes_Is_preempt(mode_set) ? true : false; 200e420: 80 a0 00 01 cmp %g0, %g1 200e424: 82 60 3f ff subx %g0, -1, %g1 200e428: c2 2f 20 74 stb %g1, [ %i4 + 0x74 ] if ( mask & RTEMS_TIMESLICE_MASK ) { 200e42c: 80 8e 62 00 btst 0x200, %i1 200e430: 02 80 00 0b be 200e45c 200e434: 80 8e 60 0f btst 0xf, %i1 if ( _Modes_Is_timeslice(mode_set) ) { 200e438: 80 8e 22 00 btst 0x200, %i0 200e43c: 22 80 00 07 be,a 200e458 200e440: c0 27 20 7c clr [ %i4 + 0x7c ] executing->budget_algorithm = THREAD_CPU_BUDGET_ALGORITHM_RESET_TIMESLICE; 200e444: 82 10 20 01 mov 1, %g1 200e448: c2 27 20 7c st %g1, [ %i4 + 0x7c ] executing->cpu_time_budget = _Thread_Ticks_per_timeslice; 200e44c: 03 00 80 72 sethi %hi(0x201c800), %g1 200e450: c2 00 60 64 ld [ %g1 + 0x64 ], %g1 ! 201c864 <_Thread_Ticks_per_timeslice> 200e454: c2 27 20 78 st %g1, [ %i4 + 0x78 ] } /* * Set the new interrupt level */ if ( mask & RTEMS_INTERRUPT_MASK ) 200e458: 80 8e 60 0f btst 0xf, %i1 200e45c: 02 80 00 06 be 200e474 200e460: 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 ); 200e464: 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 ) ); 200e468: 7f ff cf 2d call 200211c 200e46c: 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 ) { 200e470: 80 8e 64 00 btst 0x400, %i1 200e474: 02 80 00 14 be 200e4c4 200e478: 88 10 20 00 clr %g4 is_asr_enabled = _Modes_Is_asr_disabled( mode_set ) ? false : true; if ( is_asr_enabled != asr->is_enabled ) { 200e47c: 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; 200e480: 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( 200e484: 80 a0 00 18 cmp %g0, %i0 200e488: 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 ) { 200e48c: 80 a0 40 02 cmp %g1, %g2 200e490: 22 80 00 0e be,a 200e4c8 200e494: 03 00 80 72 sethi %hi(0x201c800), %g1 ) { rtems_signal_set _signals; ISR_Level _level; _ISR_Disable( _level ); 200e498: 7f ff cf 1d call 200210c 200e49c: c2 2f 60 08 stb %g1, [ %i5 + 8 ] _signals = information->signals_pending; 200e4a0: c2 07 60 18 ld [ %i5 + 0x18 ], %g1 information->signals_pending = information->signals_posted; 200e4a4: c4 07 60 14 ld [ %i5 + 0x14 ], %g2 information->signals_posted = _signals; 200e4a8: 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; 200e4ac: c4 27 60 18 st %g2, [ %i5 + 0x18 ] information->signals_posted = _signals; _ISR_Enable( _level ); 200e4b0: 7f ff cf 1b call 200211c 200e4b4: 01 00 00 00 nop asr->is_enabled = is_asr_enabled; _ASR_Swap_signals( asr ); if ( _ASR_Are_signals_pending( asr ) ) { 200e4b8: c2 07 60 14 ld [ %i5 + 0x14 ], %g1 /* * This is specific to the RTEMS API */ is_asr_enabled = false; needs_asr_dispatching = false; 200e4bc: 80 a0 00 01 cmp %g0, %g1 200e4c0: 88 40 20 00 addx %g0, 0, %g4 needs_asr_dispatching = true; } } } if ( _System_state_Is_up( _System_state_Get() ) ) { 200e4c4: 03 00 80 72 sethi %hi(0x201c800), %g1 200e4c8: c4 00 62 5c ld [ %g1 + 0x25c ], %g2 ! 201ca5c <_System_state_Current> 200e4cc: 80 a0 a0 03 cmp %g2, 3 200e4d0: 12 80 00 16 bne 200e528 200e4d4: 82 10 20 00 clr %g1 bool are_signals_pending ) { Thread_Control *executing; executing = _Thread_Executing; 200e4d8: 07 00 80 73 sethi %hi(0x201cc00), %g3 if ( are_signals_pending || 200e4dc: 80 89 20 ff btst 0xff, %g4 bool are_signals_pending ) { Thread_Control *executing; executing = _Thread_Executing; 200e4e0: 86 10 e2 38 or %g3, 0x238, %g3 if ( are_signals_pending || 200e4e4: 12 80 00 0a bne 200e50c 200e4e8: c4 00 e0 0c ld [ %g3 + 0xc ], %g2 200e4ec: c6 00 e0 10 ld [ %g3 + 0x10 ], %g3 200e4f0: 80 a0 80 03 cmp %g2, %g3 200e4f4: 02 80 00 0d be 200e528 200e4f8: 01 00 00 00 nop (!_Thread_Is_heir( executing ) && executing->is_preemptible) ) { 200e4fc: c4 08 a0 74 ldub [ %g2 + 0x74 ], %g2 200e500: 80 a0 a0 00 cmp %g2, 0 200e504: 02 80 00 09 be 200e528 <== NEVER TAKEN 200e508: 01 00 00 00 nop _Thread_Dispatch_necessary = true; 200e50c: 84 10 20 01 mov 1, %g2 ! 1 200e510: 03 00 80 73 sethi %hi(0x201cc00), %g1 200e514: 82 10 62 38 or %g1, 0x238, %g1 ! 201ce38 <_Per_CPU_Information> 200e518: c4 28 60 18 stb %g2, [ %g1 + 0x18 ] if (_Thread_Evaluate_is_dispatch_needed( needs_asr_dispatching ) ) _Thread_Dispatch(); 200e51c: 7f ff e9 46 call 2008a34 <_Thread_Dispatch> 200e520: 01 00 00 00 nop } return RTEMS_SUCCESSFUL; 200e524: 82 10 20 00 clr %g1 ! 0 } 200e528: 81 c7 e0 08 ret 200e52c: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 0200a9b4 : rtems_status_code rtems_task_set_priority( rtems_id id, rtems_task_priority new_priority, rtems_task_priority *old_priority ) { 200a9b4: 9d e3 bf 98 save %sp, -104, %sp register Thread_Control *the_thread; Objects_Locations location; if ( new_priority != RTEMS_CURRENT_PRIORITY && 200a9b8: 80 a6 60 00 cmp %i1, 0 200a9bc: 02 80 00 07 be 200a9d8 200a9c0: 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 ) ); 200a9c4: 03 00 80 65 sethi %hi(0x2019400), %g1 200a9c8: c2 08 61 1c ldub [ %g1 + 0x11c ], %g1 ! 201951c 200a9cc: 80 a6 40 01 cmp %i1, %g1 200a9d0: 18 80 00 1c bgu 200aa40 200a9d4: b0 10 20 13 mov 0x13, %i0 !_RTEMS_tasks_Priority_is_valid( new_priority ) ) return RTEMS_INVALID_PRIORITY; if ( !old_priority ) 200a9d8: 80 a6 a0 00 cmp %i2, 0 200a9dc: 02 80 00 19 be 200aa40 200a9e0: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; the_thread = _Thread_Get( id, &location ); 200a9e4: 40 00 09 51 call 200cf28 <_Thread_Get> 200a9e8: 92 07 bf fc add %fp, -4, %o1 switch ( location ) { 200a9ec: c2 07 bf fc ld [ %fp + -4 ], %g1 200a9f0: 80 a0 60 00 cmp %g1, 0 200a9f4: 12 80 00 13 bne 200aa40 200a9f8: b0 10 20 04 mov 4, %i0 case OBJECTS_LOCAL: /* XXX need helper to "convert" from core priority */ *old_priority = the_thread->current_priority; 200a9fc: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 if ( new_priority != RTEMS_CURRENT_PRIORITY ) { 200aa00: 80 a6 60 00 cmp %i1, 0 200aa04: 02 80 00 0d be 200aa38 200aa08: c2 26 80 00 st %g1, [ %i2 ] the_thread->real_priority = new_priority; if ( the_thread->resource_count == 0 || 200aa0c: c2 02 20 1c ld [ %o0 + 0x1c ], %g1 200aa10: 80 a0 60 00 cmp %g1, 0 200aa14: 02 80 00 06 be 200aa2c 200aa18: f2 22 20 18 st %i1, [ %o0 + 0x18 ] 200aa1c: c2 02 20 14 ld [ %o0 + 0x14 ], %g1 200aa20: 80 a0 40 19 cmp %g1, %i1 200aa24: 08 80 00 05 bleu 200aa38 <== ALWAYS TAKEN 200aa28: 01 00 00 00 nop the_thread->current_priority > new_priority ) _Thread_Change_priority( the_thread, new_priority, false ); 200aa2c: 92 10 00 19 mov %i1, %o1 200aa30: 40 00 08 0f call 200ca6c <_Thread_Change_priority> 200aa34: 94 10 20 00 clr %o2 } _Thread_Enable_dispatch(); 200aa38: 40 00 09 30 call 200cef8 <_Thread_Enable_dispatch> 200aa3c: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 200aa40: 81 c7 e0 08 ret 200aa44: 81 e8 00 00 restore =============================================================================== 02016694 : */ rtems_status_code rtems_timer_cancel( rtems_id id ) { 2016694: 9d e3 bf 98 save %sp, -104, %sp RTEMS_INLINE_ROUTINE Timer_Control *_Timer_Get ( Objects_Id id, Objects_Locations *location ) { return (Timer_Control *) 2016698: 11 00 80 f8 sethi %hi(0x203e000), %o0 201669c: 92 10 00 18 mov %i0, %o1 20166a0: 90 12 21 e4 or %o0, 0x1e4, %o0 20166a4: 40 00 0b f2 call 201966c <_Objects_Get> 20166a8: 94 07 bf fc add %fp, -4, %o2 Timer_Control *the_timer; Objects_Locations location; the_timer = _Timer_Get( id, &location ); switch ( location ) { 20166ac: c2 07 bf fc ld [ %fp + -4 ], %g1 20166b0: 80 a0 60 00 cmp %g1, 0 20166b4: 12 80 00 0c bne 20166e4 20166b8: 01 00 00 00 nop case OBJECTS_LOCAL: if ( !_Timer_Is_dormant_class( the_timer->the_class ) ) 20166bc: c2 02 20 38 ld [ %o0 + 0x38 ], %g1 20166c0: 80 a0 60 04 cmp %g1, 4 20166c4: 02 80 00 04 be 20166d4 <== NEVER TAKEN 20166c8: 01 00 00 00 nop (void) _Watchdog_Remove( &the_timer->Ticker ); 20166cc: 40 00 14 1d call 201b740 <_Watchdog_Remove> 20166d0: 90 02 20 10 add %o0, 0x10, %o0 _Thread_Enable_dispatch(); 20166d4: 40 00 0f 71 call 201a498 <_Thread_Enable_dispatch> 20166d8: b0 10 20 00 clr %i0 return RTEMS_SUCCESSFUL; 20166dc: 81 c7 e0 08 ret 20166e0: 81 e8 00 00 restore case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; } 20166e4: 81 c7 e0 08 ret 20166e8: 91 e8 20 04 restore %g0, 4, %o0 =============================================================================== 02016b90 : rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 2016b90: 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; 2016b94: 03 00 80 f8 sethi %hi(0x203e000), %g1 2016b98: f8 00 62 24 ld [ %g1 + 0x224 ], %i4 ! 203e224 <_Timer_server> rtems_id id, rtems_time_of_day *wall_time, rtems_timer_service_routine_entry routine, void *user_data ) { 2016b9c: 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 ) 2016ba0: 80 a7 20 00 cmp %i4, 0 2016ba4: 02 80 00 32 be 2016c6c 2016ba8: b0 10 20 0e mov 0xe, %i0 return RTEMS_INCORRECT_STATE; if ( !_TOD_Is_set ) 2016bac: 03 00 80 f6 sethi %hi(0x203d800), %g1 2016bb0: c2 08 60 80 ldub [ %g1 + 0x80 ], %g1 ! 203d880 <_TOD_Is_set> 2016bb4: 80 a0 60 00 cmp %g1, 0 2016bb8: 02 80 00 2d be 2016c6c <== NEVER TAKEN 2016bbc: b0 10 20 0b mov 0xb, %i0 return RTEMS_NOT_DEFINED; if ( !routine ) 2016bc0: 80 a6 a0 00 cmp %i2, 0 2016bc4: 02 80 00 2a be 2016c6c 2016bc8: b0 10 20 09 mov 9, %i0 return RTEMS_INVALID_ADDRESS; if ( !_TOD_Validate( wall_time ) ) 2016bcc: 90 10 00 19 mov %i1, %o0 2016bd0: 7f ff f4 11 call 2013c14 <_TOD_Validate> 2016bd4: b0 10 20 14 mov 0x14, %i0 2016bd8: 80 8a 20 ff btst 0xff, %o0 2016bdc: 02 80 00 27 be 2016c78 2016be0: 01 00 00 00 nop return RTEMS_INVALID_CLOCK; seconds = _TOD_To_seconds( wall_time ); 2016be4: 7f ff f3 d8 call 2013b44 <_TOD_To_seconds> 2016be8: 90 10 00 19 mov %i1, %o0 if ( seconds <= _TOD_Seconds_since_epoch() ) 2016bec: 21 00 80 f6 sethi %hi(0x203d800), %l0 2016bf0: c2 04 20 fc ld [ %l0 + 0xfc ], %g1 ! 203d8fc <_TOD_Now> 2016bf4: 80 a2 00 01 cmp %o0, %g1 2016bf8: 08 80 00 1d bleu 2016c6c 2016bfc: b2 10 00 08 mov %o0, %i1 2016c00: 11 00 80 f8 sethi %hi(0x203e000), %o0 2016c04: 92 10 00 1d mov %i5, %o1 2016c08: 90 12 21 e4 or %o0, 0x1e4, %o0 2016c0c: 40 00 0a 98 call 201966c <_Objects_Get> 2016c10: 94 07 bf fc add %fp, -4, %o2 return RTEMS_INVALID_CLOCK; the_timer = _Timer_Get( id, &location ); switch ( location ) { 2016c14: c2 07 bf fc ld [ %fp + -4 ], %g1 2016c18: 80 a0 60 00 cmp %g1, 0 2016c1c: 12 80 00 16 bne 2016c74 2016c20: b0 10 00 08 mov %o0, %i0 case OBJECTS_LOCAL: (void) _Watchdog_Remove( &the_timer->Ticker ); 2016c24: 40 00 12 c7 call 201b740 <_Watchdog_Remove> 2016c28: 90 02 20 10 add %o0, 0x10, %o0 the_timer->the_class = TIMER_TIME_OF_DAY_ON_TASK; 2016c2c: 82 10 20 03 mov 3, %g1 2016c30: 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(); 2016c34: c2 04 20 fc ld [ %l0 + 0xfc ], %g1 (*timer_server->schedule_operation)( timer_server, the_timer ); 2016c38: 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(); 2016c3c: b2 26 40 01 sub %i1, %g1, %i1 (*timer_server->schedule_operation)( timer_server, the_timer ); 2016c40: c2 07 20 04 ld [ %i4 + 4 ], %g1 2016c44: 90 10 00 1c mov %i4, %o0 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2016c48: c0 26 20 18 clr [ %i0 + 0x18 ] the_watchdog->routine = routine; 2016c4c: f4 26 20 2c st %i2, [ %i0 + 0x2c ] the_watchdog->id = id; 2016c50: fa 26 20 30 st %i5, [ %i0 + 0x30 ] the_watchdog->user_data = user_data; 2016c54: 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(); 2016c58: f2 26 20 1c st %i1, [ %i0 + 0x1c ] (*timer_server->schedule_operation)( timer_server, the_timer ); 2016c5c: 9f c0 40 00 call %g1 2016c60: b0 10 20 00 clr %i0 _Thread_Enable_dispatch(); 2016c64: 40 00 0e 0d call 201a498 <_Thread_Enable_dispatch> 2016c68: 01 00 00 00 nop return RTEMS_SUCCESSFUL; 2016c6c: 81 c7 e0 08 ret 2016c70: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } return RTEMS_INVALID_ID; 2016c74: b0 10 20 04 mov 4, %i0 } 2016c78: 81 c7 e0 08 ret 2016c7c: 81 e8 00 00 restore =============================================================================== 02006734 : #include int sched_get_priority_max( int policy ) { 2006734: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 2006738: 80 a6 20 04 cmp %i0, 4 200673c: 18 80 00 06 bgu 2006754 2006740: 82 10 20 01 mov 1, %g1 2006744: b1 28 40 18 sll %g1, %i0, %i0 2006748: 80 8e 20 17 btst 0x17, %i0 200674c: 12 80 00 08 bne 200676c <== ALWAYS TAKEN 2006750: 03 00 80 71 sethi %hi(0x201c400), %g1 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2006754: 40 00 22 8e call 200f18c <__errno> 2006758: b0 10 3f ff mov -1, %i0 200675c: 82 10 20 16 mov 0x16, %g1 2006760: c2 22 00 00 st %g1, [ %o0 ] 2006764: 81 c7 e0 08 ret 2006768: 81 e8 00 00 restore } return POSIX_SCHEDULER_MAXIMUM_PRIORITY; 200676c: f0 08 62 3c ldub [ %g1 + 0x23c ], %i0 } 2006770: 81 c7 e0 08 ret 2006774: 91 ee 3f ff restore %i0, -1, %o0 =============================================================================== 02006778 : #include int sched_get_priority_min( int policy ) { 2006778: 9d e3 bf a0 save %sp, -96, %sp switch ( policy ) { 200677c: 80 a6 20 04 cmp %i0, 4 2006780: 18 80 00 06 bgu 2006798 2006784: 82 10 20 01 mov 1, %g1 2006788: 83 28 40 18 sll %g1, %i0, %g1 200678c: 80 88 60 17 btst 0x17, %g1 2006790: 12 80 00 06 bne 20067a8 <== ALWAYS TAKEN 2006794: b0 10 20 01 mov 1, %i0 case SCHED_RR: case SCHED_SPORADIC: break; default: rtems_set_errno_and_return_minus_one( EINVAL ); 2006798: 40 00 22 7d call 200f18c <__errno> 200679c: b0 10 3f ff mov -1, %i0 20067a0: 82 10 20 16 mov 0x16, %g1 20067a4: c2 22 00 00 st %g1, [ %o0 ] } return POSIX_SCHEDULER_MINIMUM_PRIORITY; } 20067a8: 81 c7 e0 08 ret 20067ac: 81 e8 00 00 restore =============================================================================== 020067b0 : int sched_rr_get_interval( pid_t pid, struct timespec *interval ) { 20067b0: 9d e3 bf a0 save %sp, -96, %sp /* * Only supported for the "calling process" (i.e. this node). */ if ( pid && pid != getpid() ) 20067b4: 80 a6 20 00 cmp %i0, 0 20067b8: 02 80 00 0b be 20067e4 <== NEVER TAKEN 20067bc: 80 a6 60 00 cmp %i1, 0 20067c0: 7f ff f2 65 call 2003154 20067c4: 01 00 00 00 nop 20067c8: 80 a6 00 08 cmp %i0, %o0 20067cc: 02 80 00 06 be 20067e4 20067d0: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( ESRCH ); 20067d4: 40 00 22 6e call 200f18c <__errno> 20067d8: 01 00 00 00 nop 20067dc: 10 80 00 07 b 20067f8 20067e0: 82 10 20 03 mov 3, %g1 ! 3 if ( !interval ) 20067e4: 12 80 00 08 bne 2006804 20067e8: 03 00 80 74 sethi %hi(0x201d000), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 20067ec: 40 00 22 68 call 200f18c <__errno> 20067f0: 01 00 00 00 nop 20067f4: 82 10 20 16 mov 0x16, %g1 ! 16 20067f8: c2 22 00 00 st %g1, [ %o0 ] 20067fc: 81 c7 e0 08 ret 2006800: 91 e8 3f ff restore %g0, -1, %o0 _Timespec_From_ticks( _Thread_Ticks_per_timeslice, interval ); 2006804: d0 00 62 84 ld [ %g1 + 0x284 ], %o0 2006808: 92 10 00 19 mov %i1, %o1 200680c: 40 00 0e 82 call 200a214 <_Timespec_From_ticks> 2006810: b0 10 20 00 clr %i0 return 0; } 2006814: 81 c7 e0 08 ret 2006818: 81 e8 00 00 restore =============================================================================== 02009344 : int oflag, ... /* mode_t mode, */ /* unsigned int value */ ) { 2009344: 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++; 2009348: 03 00 80 89 sethi %hi(0x2022400), %g1 200934c: c4 00 60 e0 ld [ %g1 + 0xe0 ], %g2 ! 20224e0 <_Thread_Dispatch_disable_level> Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { va_start(arg, oflag); 2009350: f4 27 a0 4c st %i2, [ %fp + 0x4c ] 2009354: 84 00 a0 01 inc %g2 2009358: c4 20 60 e0 st %g2, [ %g1 + 0xe0 ] return _Thread_Dispatch_disable_level; 200935c: c2 00 60 e0 ld [ %g1 + 0xe0 ], %g1 2009360: f6 27 a0 50 st %i3, [ %fp + 0x50 ] 2009364: f8 27 a0 54 st %i4, [ %fp + 0x54 ] 2009368: fa 27 a0 58 st %i5, [ %fp + 0x58 ] POSIX_Semaphore_Control *the_semaphore; Objects_Locations location; _Thread_Disable_dispatch(); if ( oflag & O_CREAT ) { 200936c: b8 8e 62 00 andcc %i1, 0x200, %i4 2009370: 02 80 00 05 be 2009384 2009374: ba 10 20 00 clr %i5 va_start(arg, oflag); mode = (mode_t) va_arg( arg, unsigned int ); value = va_arg( arg, unsigned int ); 2009378: fa 07 a0 50 ld [ %fp + 0x50 ], %i5 200937c: 82 07 a0 54 add %fp, 0x54, %g1 2009380: c2 27 bf f0 st %g1, [ %fp + -16 ] va_end(arg); } status = _POSIX_Semaphore_Name_to_id( name, &the_semaphore_id ); 2009384: 90 10 00 18 mov %i0, %o0 2009388: 40 00 1a 0d call 200fbbc <_POSIX_Semaphore_Name_to_id> 200938c: 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 ) { 2009390: b6 92 20 00 orcc %o0, 0, %i3 2009394: 22 80 00 0e be,a 20093cc 2009398: 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) ) ) { 200939c: 80 a6 e0 02 cmp %i3, 2 20093a0: 12 80 00 04 bne 20093b0 <== NEVER TAKEN 20093a4: 80 a7 20 00 cmp %i4, 0 20093a8: 12 80 00 21 bne 200942c 20093ac: 94 10 00 1d mov %i5, %o2 _Thread_Enable_dispatch(); 20093b0: 40 00 0b ee call 200c368 <_Thread_Enable_dispatch> 20093b4: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( status, sem_t * ); 20093b8: 40 00 25 a3 call 2012a44 <__errno> 20093bc: 01 00 00 00 nop 20093c0: f6 22 00 00 st %i3, [ %o0 ] 20093c4: 81 c7 e0 08 ret 20093c8: 81 e8 00 00 restore /* * Check for existence with creation. */ if ( (oflag & (O_CREAT | O_EXCL)) == (O_CREAT | O_EXCL) ) { 20093cc: 80 a6 6a 00 cmp %i1, 0xa00 20093d0: 12 80 00 0a bne 20093f8 20093d4: d2 07 bf f4 ld [ %fp + -12 ], %o1 _Thread_Enable_dispatch(); 20093d8: 40 00 0b e4 call 200c368 <_Thread_Enable_dispatch> 20093dc: b0 10 3f ff mov -1, %i0 rtems_set_errno_and_return_minus_one_cast( EEXIST, sem_t * ); 20093e0: 40 00 25 99 call 2012a44 <__errno> 20093e4: 01 00 00 00 nop 20093e8: 82 10 20 11 mov 0x11, %g1 ! 11 20093ec: c2 22 00 00 st %g1, [ %o0 ] 20093f0: 81 c7 e0 08 ret 20093f4: 81 e8 00 00 restore 20093f8: 94 07 bf fc add %fp, -4, %o2 20093fc: 11 00 80 89 sethi %hi(0x2022400), %o0 2009400: 40 00 08 5b call 200b56c <_Objects_Get> 2009404: 90 12 23 a0 or %o0, 0x3a0, %o0 ! 20227a0 <_POSIX_Semaphore_Information> } the_semaphore = _POSIX_Semaphore_Get( &the_semaphore_id, &location ); the_semaphore->open_count += 1; 2009408: 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 ); 200940c: d0 27 bf f8 st %o0, [ %fp + -8 ] the_semaphore->open_count += 1; 2009410: 82 00 60 01 inc %g1 _Thread_Enable_dispatch(); 2009414: 40 00 0b d5 call 200c368 <_Thread_Enable_dispatch> 2009418: c2 22 20 18 st %g1, [ %o0 + 0x18 ] _Thread_Enable_dispatch(); 200941c: 40 00 0b d3 call 200c368 <_Thread_Enable_dispatch> 2009420: 01 00 00 00 nop goto return_id; 2009424: 10 80 00 0c b 2009454 2009428: 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( 200942c: 90 10 00 18 mov %i0, %o0 2009430: 92 10 20 00 clr %o1 2009434: 40 00 19 8a call 200fa5c <_POSIX_Semaphore_Create_support> 2009438: 96 07 bf f8 add %fp, -8, %o3 /* * errno was set by Create_support, so don't set it again. */ _Thread_Enable_dispatch(); 200943c: 40 00 0b cb call 200c368 <_Thread_Enable_dispatch> 2009440: ba 10 00 08 mov %o0, %i5 if ( status == -1 ) 2009444: 80 a7 7f ff cmp %i5, -1 2009448: 02 bf ff ea be 20093f0 200944c: 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; 2009450: f0 07 bf f8 ld [ %fp + -8 ], %i0 2009454: b0 06 20 08 add %i0, 8, %i0 } 2009458: 81 c7 e0 08 ret 200945c: 81 e8 00 00 restore =============================================================================== 020066c8 : int sigaction( int sig, const struct sigaction *act, struct sigaction *oact ) { 20066c8: 9d e3 bf a0 save %sp, -96, %sp ISR_Level level; if ( oact ) 20066cc: 90 96 a0 00 orcc %i2, 0, %o0 20066d0: 02 80 00 09 be 20066f4 20066d4: 83 2e 20 02 sll %i0, 2, %g1 *oact = _POSIX_signals_Vectors[ sig ]; 20066d8: 85 2e 20 04 sll %i0, 4, %g2 20066dc: 82 20 80 01 sub %g2, %g1, %g1 20066e0: 13 00 80 7a sethi %hi(0x201e800), %o1 20066e4: 94 10 20 0c mov 0xc, %o2 20066e8: 92 12 60 d0 or %o1, 0xd0, %o1 20066ec: 40 00 25 fb call 200fed8 20066f0: 92 02 40 01 add %o1, %g1, %o1 if ( !sig ) 20066f4: 80 a6 20 00 cmp %i0, 0 20066f8: 02 80 00 09 be 200671c 20066fc: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 2006700: 82 06 3f ff add %i0, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(sig) ) 2006704: 80 a0 60 1f cmp %g1, 0x1f 2006708: 18 80 00 05 bgu 200671c 200670c: 01 00 00 00 nop * * NOTE: Solaris documentation claims to "silently enforce" this which * contradicts the POSIX specification. */ if ( sig == SIGKILL ) 2006710: 80 a6 20 09 cmp %i0, 9 2006714: 12 80 00 08 bne 2006734 2006718: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); 200671c: 40 00 23 b0 call 200f5dc <__errno> 2006720: 01 00 00 00 nop 2006724: 82 10 20 16 mov 0x16, %g1 ! 16 2006728: c2 22 00 00 st %g1, [ %o0 ] 200672c: 10 80 00 20 b 20067ac 2006730: 82 10 3f ff mov -1, %g1 /* * Evaluate the new action structure and set the global signal vector * appropriately. */ if ( act ) { 2006734: 02 80 00 1e be 20067ac <== NEVER TAKEN 2006738: 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 ); 200673c: 7f ff ef 6b call 20024e8 2006740: 01 00 00 00 nop 2006744: ba 10 00 08 mov %o0, %i5 if ( act->sa_handler == SIG_DFL ) { 2006748: c2 06 60 08 ld [ %i1 + 8 ], %g1 200674c: 39 00 80 7a sethi %hi(0x201e800), %i4 2006750: 80 a0 60 00 cmp %g1, 0 2006754: 12 80 00 0a bne 200677c 2006758: b8 17 20 d0 or %i4, 0xd0, %i4 _POSIX_signals_Vectors[ sig ] = _POSIX_signals_Default_vectors[ sig ]; 200675c: 83 2e 20 02 sll %i0, 2, %g1 2006760: 13 00 80 72 sethi %hi(0x201c800), %o1 2006764: b1 2e 20 04 sll %i0, 4, %i0 2006768: 92 12 63 94 or %o1, 0x394, %o1 200676c: b0 26 00 01 sub %i0, %g1, %i0 2006770: 90 07 00 18 add %i4, %i0, %o0 2006774: 10 80 00 09 b 2006798 2006778: 92 02 40 18 add %o1, %i0, %o1 } else { _POSIX_signals_Clear_process_signals( sig ); 200677c: 40 00 17 fd call 200c770 <_POSIX_signals_Clear_process_signals> 2006780: 90 10 00 18 mov %i0, %o0 _POSIX_signals_Vectors[ sig ] = *act; 2006784: 83 2e 20 02 sll %i0, 2, %g1 2006788: 92 10 00 19 mov %i1, %o1 200678c: b1 2e 20 04 sll %i0, 4, %i0 2006790: 90 26 00 01 sub %i0, %g1, %o0 2006794: 90 07 00 08 add %i4, %o0, %o0 2006798: 40 00 25 d0 call 200fed8 200679c: 94 10 20 0c mov 0xc, %o2 } _ISR_Enable( level ); 20067a0: 7f ff ef 56 call 20024f8 20067a4: 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; 20067a8: 82 10 20 00 clr %g1 } 20067ac: 81 c7 e0 08 ret 20067b0: 91 e8 00 01 restore %g0, %g1, %o0 =============================================================================== 02006b88 : int sigtimedwait( const sigset_t *set, siginfo_t *info, const struct timespec *timeout ) { 2006b88: 9d e3 bf 90 save %sp, -112, %sp ISR_Level level; /* * Error check parameters before disabling interrupts. */ if ( !set ) 2006b8c: ba 96 20 00 orcc %i0, 0, %i5 2006b90: 02 80 00 0f be 2006bcc 2006b94: 01 00 00 00 nop /* NOTE: This is very specifically a RELATIVE not ABSOLUTE time * in the Open Group specification. */ interval = 0; if ( timeout ) { 2006b98: 80 a6 a0 00 cmp %i2, 0 2006b9c: 02 80 00 12 be 2006be4 2006ba0: a0 10 20 00 clr %l0 if ( !_Timespec_Is_valid( timeout ) ) 2006ba4: 40 00 0e b1 call 200a668 <_Timespec_Is_valid> 2006ba8: 90 10 00 1a mov %i2, %o0 2006bac: 80 8a 20 ff btst 0xff, %o0 2006bb0: 02 80 00 07 be 2006bcc 2006bb4: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); interval = _Timespec_To_ticks( timeout ); 2006bb8: 40 00 0e ce call 200a6f0 <_Timespec_To_ticks> 2006bbc: 90 10 00 1a mov %i2, %o0 if ( !interval ) 2006bc0: a0 92 20 00 orcc %o0, 0, %l0 2006bc4: 12 80 00 09 bne 2006be8 <== ALWAYS TAKEN 2006bc8: 80 a6 60 00 cmp %i1, 0 rtems_set_errno_and_return_minus_one( EINVAL ); 2006bcc: 40 00 24 50 call 200fd0c <__errno> 2006bd0: b0 10 3f ff mov -1, %i0 2006bd4: 82 10 20 16 mov 0x16, %g1 2006bd8: c2 22 00 00 st %g1, [ %o0 ] 2006bdc: 81 c7 e0 08 ret 2006be0: 81 e8 00 00 restore /* * Initialize local variables. */ the_info = ( info ) ? info : &signal_information; 2006be4: 80 a6 60 00 cmp %i1, 0 2006be8: 22 80 00 02 be,a 2006bf0 2006bec: b2 07 bf f4 add %fp, -12, %i1 the_thread = _Thread_Executing; 2006bf0: 31 00 80 7c sethi %hi(0x201f000), %i0 2006bf4: b0 16 20 88 or %i0, 0x88, %i0 ! 201f088 <_Per_CPU_Information> 2006bf8: f4 06 20 0c ld [ %i0 + 0xc ], %i2 * What if they are already pending? */ /* API signals pending? */ _ISR_Disable( level ); 2006bfc: 7f ff ef 16 call 2002854 2006c00: f6 06 a1 5c ld [ %i2 + 0x15c ], %i3 2006c04: b8 10 00 08 mov %o0, %i4 if ( *set & api->signals_pending ) { 2006c08: c4 07 40 00 ld [ %i5 ], %g2 2006c0c: c2 06 e0 d4 ld [ %i3 + 0xd4 ], %g1 2006c10: 80 88 80 01 btst %g2, %g1 2006c14: 22 80 00 13 be,a 2006c60 2006c18: 03 00 80 7c sethi %hi(0x201f000), %g1 /* XXX real info later */ the_info->si_signo = _POSIX_signals_Get_lowest( api->signals_pending ); 2006c1c: 7f ff ff c3 call 2006b28 <_POSIX_signals_Get_lowest> 2006c20: 90 10 00 01 mov %g1, %o0 _POSIX_signals_Clear_signals( 2006c24: 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 ); 2006c28: 92 10 00 08 mov %o0, %o1 2006c2c: d0 26 40 00 st %o0, [ %i1 ] _POSIX_signals_Clear_signals( 2006c30: 96 10 20 00 clr %o3 2006c34: 90 10 00 1b mov %i3, %o0 2006c38: 40 00 18 cb call 200cf64 <_POSIX_signals_Clear_signals> 2006c3c: 98 10 20 00 clr %o4 the_info->si_signo, the_info, false, false ); _ISR_Enable( level ); 2006c40: 7f ff ef 09 call 2002864 2006c44: 90 10 00 1c mov %i4, %o0 the_info->si_code = SI_USER; 2006c48: 82 10 20 01 mov 1, %g1 the_info->si_value.sival_int = 0; 2006c4c: c0 26 60 08 clr [ %i1 + 8 ] false, false ); _ISR_Enable( level ); the_info->si_code = SI_USER; 2006c50: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; return the_info->si_signo; 2006c54: f0 06 40 00 ld [ %i1 ], %i0 2006c58: 81 c7 e0 08 ret 2006c5c: 81 e8 00 00 restore } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { 2006c60: c2 00 62 d4 ld [ %g1 + 0x2d4 ], %g1 2006c64: 80 88 80 01 btst %g2, %g1 2006c68: 22 80 00 13 be,a 2006cb4 2006c6c: 82 10 3f ff mov -1, %g1 signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 2006c70: 7f ff ff ae call 2006b28 <_POSIX_signals_Get_lowest> 2006c74: 90 10 00 01 mov %g1, %o0 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 2006c78: 94 10 00 19 mov %i1, %o2 } /* Process pending signals? */ if ( *set & _POSIX_signals_Pending ) { signo = _POSIX_signals_Get_lowest( _POSIX_signals_Pending ); 2006c7c: b0 10 00 08 mov %o0, %i0 _POSIX_signals_Clear_signals( api, signo, the_info, true, false ); 2006c80: 96 10 20 01 mov 1, %o3 2006c84: 90 10 00 1b mov %i3, %o0 2006c88: 92 10 00 18 mov %i0, %o1 2006c8c: 40 00 18 b6 call 200cf64 <_POSIX_signals_Clear_signals> 2006c90: 98 10 20 00 clr %o4 _ISR_Enable( level ); 2006c94: 7f ff ee f4 call 2002864 2006c98: 90 10 00 1c mov %i4, %o0 the_info->si_signo = signo; the_info->si_code = SI_USER; 2006c9c: 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; 2006ca0: f0 26 40 00 st %i0, [ %i1 ] the_info->si_code = SI_USER; 2006ca4: c2 26 60 04 st %g1, [ %i1 + 4 ] the_info->si_value.sival_int = 0; 2006ca8: c0 26 60 08 clr [ %i1 + 8 ] return signo; 2006cac: 81 c7 e0 08 ret 2006cb0: 81 e8 00 00 restore } the_info->si_signo = -1; 2006cb4: 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++; 2006cb8: 03 00 80 7a sethi %hi(0x201e800), %g1 2006cbc: c4 00 63 50 ld [ %g1 + 0x350 ], %g2 ! 201eb50 <_Thread_Dispatch_disable_level> 2006cc0: 84 00 a0 01 inc %g2 2006cc4: c4 20 63 50 st %g2, [ %g1 + 0x350 ] return _Thread_Dispatch_disable_level; 2006cc8: c2 00 63 50 ld [ %g1 + 0x350 ], %g1 _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; the_thread->Wait.return_code = EINTR; 2006ccc: 82 10 20 04 mov 4, %g1 2006cd0: c2 26 a0 34 st %g1, [ %i2 + 0x34 ] the_thread->Wait.option = *set; 2006cd4: c2 07 40 00 ld [ %i5 ], %g1 the_thread->Wait.return_argument = the_info; 2006cd8: 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; 2006cdc: 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; 2006ce0: b8 10 20 01 mov 1, %i4 } the_info->si_signo = -1; _Thread_Disable_dispatch(); the_thread->Wait.queue = &_POSIX_signals_Wait_queue; 2006ce4: 23 00 80 7c sethi %hi(0x201f000), %l1 2006ce8: a2 14 62 6c or %l1, 0x26c, %l1 ! 201f26c <_POSIX_signals_Wait_queue> 2006cec: e2 26 a0 44 st %l1, [ %i2 + 0x44 ] 2006cf0: 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 ); 2006cf4: 7f ff ee dc call 2002864 2006cf8: 01 00 00 00 nop _Thread_queue_Enqueue( &_POSIX_signals_Wait_queue, interval ); 2006cfc: 90 10 00 11 mov %l1, %o0 2006d00: 92 10 00 10 mov %l0, %o1 2006d04: 15 00 80 28 sethi %hi(0x200a000), %o2 2006d08: 40 00 0c ae call 2009fc0 <_Thread_queue_Enqueue_with_handler> 2006d0c: 94 12 a3 2c or %o2, 0x32c, %o2 ! 200a32c <_Thread_queue_Timeout> _Thread_Enable_dispatch(); 2006d10: 40 00 0b 72 call 2009ad8 <_Thread_Enable_dispatch> 2006d14: 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 ); 2006d18: d2 06 40 00 ld [ %i1 ], %o1 2006d1c: 90 10 00 1b mov %i3, %o0 2006d20: 94 10 00 19 mov %i1, %o2 2006d24: 96 10 20 00 clr %o3 2006d28: 40 00 18 8f call 200cf64 <_POSIX_signals_Clear_signals> 2006d2c: 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) 2006d30: c2 06 20 0c ld [ %i0 + 0xc ], %g1 2006d34: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2006d38: 80 a0 60 04 cmp %g1, 4 2006d3c: 12 80 00 09 bne 2006d60 2006d40: 01 00 00 00 nop || !(*set & signo_to_mask( the_info->si_signo )) ) { 2006d44: f0 06 40 00 ld [ %i1 ], %i0 2006d48: 82 06 3f ff add %i0, -1, %g1 2006d4c: b9 2f 00 01 sll %i4, %g1, %i4 2006d50: c2 07 40 00 ld [ %i5 ], %g1 2006d54: 80 8f 00 01 btst %i4, %g1 2006d58: 12 80 00 08 bne 2006d78 2006d5c: 01 00 00 00 nop errno = _Thread_Executing->Wait.return_code; 2006d60: 40 00 23 eb call 200fd0c <__errno> 2006d64: b0 10 3f ff mov -1, %i0 ! ffffffff 2006d68: 03 00 80 7c sethi %hi(0x201f000), %g1 2006d6c: c2 00 60 94 ld [ %g1 + 0x94 ], %g1 ! 201f094 <_Per_CPU_Information+0xc> 2006d70: c2 00 60 34 ld [ %g1 + 0x34 ], %g1 2006d74: c2 22 00 00 st %g1, [ %o0 ] return -1; } return the_info->si_signo; } 2006d78: 81 c7 e0 08 ret 2006d7c: 81 e8 00 00 restore =============================================================================== 02008ac4 : int sigwait( const sigset_t *set, int *sig ) { 2008ac4: 9d e3 bf a0 save %sp, -96, %sp int status; status = sigtimedwait( set, NULL, NULL ); 2008ac8: 92 10 20 00 clr %o1 2008acc: 90 10 00 18 mov %i0, %o0 2008ad0: 7f ff ff 7b call 20088bc 2008ad4: 94 10 20 00 clr %o2 if ( status != -1 ) { 2008ad8: 80 a2 3f ff cmp %o0, -1 2008adc: 02 80 00 07 be 2008af8 2008ae0: 80 a6 60 00 cmp %i1, 0 if ( sig ) 2008ae4: 02 80 00 03 be 2008af0 <== NEVER TAKEN 2008ae8: b0 10 20 00 clr %i0 *sig = status; 2008aec: d0 26 40 00 st %o0, [ %i1 ] 2008af0: 81 c7 e0 08 ret 2008af4: 81 e8 00 00 restore return 0; } return errno; 2008af8: 40 00 23 2c call 20117a8 <__errno> 2008afc: 01 00 00 00 nop 2008b00: f0 02 00 00 ld [ %o0 ], %i0 } 2008b04: 81 c7 e0 08 ret 2008b08: 81 e8 00 00 restore =============================================================================== 02005a58 : */ long sysconf( int name ) { 2005a58: 9d e3 bf a0 save %sp, -96, %sp if ( name == _SC_CLK_TCK ) 2005a5c: 80 a6 20 02 cmp %i0, 2 2005a60: 12 80 00 09 bne 2005a84 2005a64: 03 00 80 58 sethi %hi(0x2016000), %g1 return (TOD_MICROSECONDS_PER_SECOND / 2005a68: 03 00 80 58 sethi %hi(0x2016000), %g1 2005a6c: d2 00 60 b8 ld [ %g1 + 0xb8 ], %o1 ! 20160b8 2005a70: 11 00 03 d0 sethi %hi(0xf4000), %o0 2005a74: 40 00 32 f5 call 2012648 <.udiv> 2005a78: 90 12 22 40 or %o0, 0x240, %o0 ! f4240 2005a7c: 81 c7 e0 08 ret 2005a80: 91 e8 00 08 restore %g0, %o0, %o0 rtems_configuration_get_microseconds_per_tick()); if ( name == _SC_OPEN_MAX ) 2005a84: 80 a6 20 04 cmp %i0, 4 2005a88: 02 80 00 10 be 2005ac8 2005a8c: d0 00 61 f0 ld [ %g1 + 0x1f0 ], %o0 return rtems_libio_number_iops; if ( name == _SC_GETPW_R_SIZE_MAX ) 2005a90: 80 a6 20 33 cmp %i0, 0x33 2005a94: 02 80 00 0d be 2005ac8 2005a98: 90 10 24 00 mov 0x400, %o0 return 1024; if ( name == _SC_PAGESIZE ) 2005a9c: 80 a6 20 08 cmp %i0, 8 2005aa0: 02 80 00 0a be 2005ac8 2005aa4: 11 00 00 04 sethi %hi(0x1000), %o0 return PAGE_SIZE; #if defined(__sparc__) if ( name == 515 ) /* Solaris _SC_STACK_PROT */ 2005aa8: 80 a6 22 03 cmp %i0, 0x203 2005aac: 02 80 00 07 be 2005ac8 <== NEVER TAKEN 2005ab0: 90 10 20 00 clr %o0 return 0; #endif rtems_set_errno_and_return_minus_one( EINVAL ); 2005ab4: 40 00 23 a0 call 200e934 <__errno> 2005ab8: 01 00 00 00 nop 2005abc: 82 10 20 16 mov 0x16, %g1 ! 16 2005ac0: c2 22 00 00 st %g1, [ %o0 ] 2005ac4: 90 10 3f ff mov -1, %o0 } 2005ac8: b0 10 00 08 mov %o0, %i0 2005acc: 81 c7 e0 08 ret 2005ad0: 81 e8 00 00 restore =============================================================================== 02005df4 : int timer_create( clockid_t clock_id, struct sigevent *evp, timer_t *timerid ) { 2005df4: 9d e3 bf a0 save %sp, -96, %sp POSIX_Timer_Control *ptimer; if ( clock_id != CLOCK_REALTIME ) 2005df8: 80 a6 20 01 cmp %i0, 1 2005dfc: 12 80 00 15 bne 2005e50 2005e00: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); if ( !timerid ) 2005e04: 80 a6 a0 00 cmp %i2, 0 2005e08: 02 80 00 12 be 2005e50 2005e0c: 01 00 00 00 nop /* * The data of the structure evp are checked in order to verify if they * are coherent. */ if (evp != NULL) { 2005e10: 80 a6 60 00 cmp %i1, 0 2005e14: 02 80 00 13 be 2005e60 2005e18: 03 00 80 74 sethi %hi(0x201d000), %g1 /* The structure has data */ if ( ( evp->sigev_notify != SIGEV_NONE ) && 2005e1c: c2 06 40 00 ld [ %i1 ], %g1 2005e20: 82 00 7f ff add %g1, -1, %g1 2005e24: 80 a0 60 01 cmp %g1, 1 2005e28: 18 80 00 0a bgu 2005e50 <== NEVER TAKEN 2005e2c: 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 ) 2005e30: c2 06 60 04 ld [ %i1 + 4 ], %g1 2005e34: 80 a0 60 00 cmp %g1, 0 2005e38: 02 80 00 06 be 2005e50 <== NEVER TAKEN 2005e3c: 01 00 00 00 nop static inline bool is_valid_signo( int signo ) { return ((signo) >= 1 && (signo) <= 32 ); 2005e40: 82 00 7f ff add %g1, -1, %g1 rtems_set_errno_and_return_minus_one( EINVAL ); if ( !is_valid_signo(evp->sigev_signo) ) 2005e44: 80 a0 60 1f cmp %g1, 0x1f 2005e48: 28 80 00 06 bleu,a 2005e60 <== ALWAYS TAKEN 2005e4c: 03 00 80 74 sethi %hi(0x201d000), %g1 rtems_set_errno_and_return_minus_one( EINVAL ); 2005e50: 40 00 24 c4 call 200f160 <__errno> 2005e54: 01 00 00 00 nop 2005e58: 10 80 00 11 b 2005e9c 2005e5c: 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++; 2005e60: c4 00 62 c0 ld [ %g1 + 0x2c0 ], %g2 2005e64: 84 00 a0 01 inc %g2 2005e68: c4 20 62 c0 st %g2, [ %g1 + 0x2c0 ] return _Thread_Dispatch_disable_level; 2005e6c: c2 00 62 c0 ld [ %g1 + 0x2c0 ], %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 ); 2005e70: 11 00 80 75 sethi %hi(0x201d400), %o0 2005e74: 40 00 07 de call 2007dec <_Objects_Allocate> 2005e78: 90 12 21 c0 or %o0, 0x1c0, %o0 ! 201d5c0 <_POSIX_Timer_Information> /* * Allocate a timer */ ptimer = _POSIX_Timer_Allocate(); if ( !ptimer ) { 2005e7c: 80 a2 20 00 cmp %o0, 0 2005e80: 12 80 00 0a bne 2005ea8 2005e84: 82 10 20 02 mov 2, %g1 _Thread_Enable_dispatch(); 2005e88: 40 00 0c 74 call 2009058 <_Thread_Enable_dispatch> 2005e8c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EAGAIN ); 2005e90: 40 00 24 b4 call 200f160 <__errno> 2005e94: 01 00 00 00 nop 2005e98: 82 10 20 0b mov 0xb, %g1 ! b 2005e9c: c2 22 00 00 st %g1, [ %o0 ] 2005ea0: 81 c7 e0 08 ret 2005ea4: 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; 2005ea8: c2 2a 20 3c stb %g1, [ %o0 + 0x3c ] ptimer->thread_id = _Thread_Executing->Object.id; 2005eac: 03 00 80 76 sethi %hi(0x201d800), %g1 2005eb0: c2 00 60 04 ld [ %g1 + 4 ], %g1 ! 201d804 <_Per_CPU_Information+0xc> if ( evp != NULL ) { 2005eb4: 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; 2005eb8: c2 00 60 08 ld [ %g1 + 8 ], %g1 if ( evp != NULL ) { 2005ebc: 02 80 00 08 be 2005edc 2005ec0: c2 22 20 38 st %g1, [ %o0 + 0x38 ] ptimer->inf.sigev_notify = evp->sigev_notify; 2005ec4: c2 06 40 00 ld [ %i1 ], %g1 2005ec8: c2 22 20 40 st %g1, [ %o0 + 0x40 ] ptimer->inf.sigev_signo = evp->sigev_signo; 2005ecc: c2 06 60 04 ld [ %i1 + 4 ], %g1 2005ed0: c2 22 20 44 st %g1, [ %o0 + 0x44 ] ptimer->inf.sigev_value = evp->sigev_value; 2005ed4: c2 06 60 08 ld [ %i1 + 8 ], %g1 2005ed8: c2 22 20 48 st %g1, [ %o0 + 0x48 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2005edc: c4 12 20 0a lduh [ %o0 + 0xa ], %g2 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2005ee0: 07 00 80 75 sethi %hi(0x201d400), %g3 2005ee4: c6 00 e1 dc ld [ %g3 + 0x1dc ], %g3 ! 201d5dc <_POSIX_Timer_Information+0x1c> } ptimer->overrun = 0; 2005ee8: c0 22 20 68 clr [ %o0 + 0x68 ] ptimer->timer_data.it_value.tv_sec = 0; 2005eec: c0 22 20 5c clr [ %o0 + 0x5c ] ptimer->timer_data.it_value.tv_nsec = 0; 2005ef0: c0 22 20 60 clr [ %o0 + 0x60 ] ptimer->timer_data.it_interval.tv_sec = 0; 2005ef4: c0 22 20 54 clr [ %o0 + 0x54 ] ptimer->timer_data.it_interval.tv_nsec = 0; 2005ef8: c0 22 20 58 clr [ %o0 + 0x58 ] Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2005efc: c0 22 20 18 clr [ %o0 + 0x18 ] the_watchdog->routine = routine; 2005f00: c0 22 20 2c clr [ %o0 + 0x2c ] the_watchdog->id = id; 2005f04: c0 22 20 30 clr [ %o0 + 0x30 ] the_watchdog->user_data = user_data; 2005f08: c0 22 20 34 clr [ %o0 + 0x34 ] Objects_Information *information, Objects_Control *the_object, uint32_t name ) { _Objects_Set_local_object( 2005f0c: c2 02 20 08 ld [ %o0 + 8 ], %g1 #if defined(RTEMS_DEBUG) if ( index > information->maximum ) return; #endif information->local_table[ index ] = the_object; 2005f10: 85 28 a0 02 sll %g2, 2, %g2 2005f14: 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; 2005f18: 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; 2005f1c: c2 26 80 00 st %g1, [ %i2 ] _Thread_Enable_dispatch(); 2005f20: 40 00 0c 4e call 2009058 <_Thread_Enable_dispatch> 2005f24: b0 10 20 00 clr %i0 return 0; } 2005f28: 81 c7 e0 08 ret 2005f2c: 81 e8 00 00 restore =============================================================================== 02005f30 : timer_t timerid, int flags, const struct itimerspec *value, struct itimerspec *ovalue ) { 2005f30: 9d e3 bf 80 save %sp, -128, %sp Objects_Locations location; bool activated; uint32_t initial_period; struct itimerspec normalize; if ( !value ) 2005f34: 80 a6 a0 00 cmp %i2, 0 2005f38: 02 80 00 20 be 2005fb8 <== NEVER TAKEN 2005f3c: 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) ) ) { 2005f40: 40 00 0f 3a call 2009c28 <_Timespec_Is_valid> 2005f44: 90 06 a0 08 add %i2, 8, %o0 2005f48: 80 8a 20 ff btst 0xff, %o0 2005f4c: 02 80 00 1b be 2005fb8 2005f50: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } if ( !_Timespec_Is_valid( &(value->it_interval) ) ) { 2005f54: 40 00 0f 35 call 2009c28 <_Timespec_Is_valid> 2005f58: 90 10 00 1a mov %i2, %o0 2005f5c: 80 8a 20 ff btst 0xff, %o0 2005f60: 02 80 00 16 be 2005fb8 <== NEVER TAKEN 2005f64: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } if ( flags != TIMER_ABSTIME && flags != POSIX_TIMER_RELATIVE ) { 2005f68: 80 a6 60 00 cmp %i1, 0 2005f6c: 02 80 00 05 be 2005f80 2005f70: 90 07 bf e4 add %fp, -28, %o0 2005f74: 80 a6 60 04 cmp %i1, 4 2005f78: 12 80 00 10 bne 2005fb8 2005f7c: 01 00 00 00 nop rtems_set_errno_and_return_minus_one( EINVAL ); } normalize = *value; 2005f80: 92 10 00 1a mov %i2, %o1 2005f84: 40 00 26 cc call 200fab4 2005f88: 94 10 20 10 mov 0x10, %o2 /* Convert absolute to relative time */ if (flags == TIMER_ABSTIME) { 2005f8c: 80 a6 60 04 cmp %i1, 4 2005f90: 12 80 00 14 bne 2005fe0 2005f94: 92 10 00 18 mov %i0, %o1 struct timespec now; _TOD_Get( &now ); 2005f98: 40 00 06 21 call 200781c <_TOD_Get> 2005f9c: 90 07 bf f4 add %fp, -12, %o0 /* Check for seconds in the past */ if ( _Timespec_Greater_than( &now, &normalize.it_value ) ) 2005fa0: 90 07 bf f4 add %fp, -12, %o0 2005fa4: 40 00 0f 11 call 2009be8 <_Timespec_Greater_than> 2005fa8: 92 07 bf ec add %fp, -20, %o1 2005fac: 80 8a 20 ff btst 0xff, %o0 2005fb0: 02 80 00 08 be 2005fd0 2005fb4: 92 07 bf ec add %fp, -20, %o1 rtems_set_errno_and_return_minus_one( EINVAL ); 2005fb8: 40 00 24 6a call 200f160 <__errno> 2005fbc: b0 10 3f ff mov -1, %i0 2005fc0: 82 10 20 16 mov 0x16, %g1 2005fc4: c2 22 00 00 st %g1, [ %o0 ] 2005fc8: 81 c7 e0 08 ret 2005fcc: 81 e8 00 00 restore _Timespec_Subtract( &now, &normalize.it_value, &normalize.it_value ); 2005fd0: 90 07 bf f4 add %fp, -12, %o0 2005fd4: 40 00 0f 26 call 2009c6c <_Timespec_Subtract> 2005fd8: 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 *) 2005fdc: 92 10 00 18 mov %i0, %o1 2005fe0: 11 00 80 75 sethi %hi(0x201d400), %o0 2005fe4: 94 07 bf fc add %fp, -4, %o2 2005fe8: 40 00 08 bc call 20082d8 <_Objects_Get> 2005fec: 90 12 21 c0 or %o0, 0x1c0, %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 ) { 2005ff0: c2 07 bf fc ld [ %fp + -4 ], %g1 2005ff4: 80 a0 60 00 cmp %g1, 0 2005ff8: 12 80 00 39 bne 20060dc 2005ffc: 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 ) { 2006000: c2 07 bf ec ld [ %fp + -20 ], %g1 2006004: 80 a0 60 00 cmp %g1, 0 2006008: 12 80 00 14 bne 2006058 200600c: c2 07 bf f0 ld [ %fp + -16 ], %g1 2006010: 80 a0 60 00 cmp %g1, 0 2006014: 12 80 00 11 bne 2006058 2006018: 01 00 00 00 nop /* Stop the timer */ (void) _Watchdog_Remove( &ptimer->Timer ); 200601c: 40 00 10 47 call 200a138 <_Watchdog_Remove> 2006020: 90 02 20 10 add %o0, 0x10, %o0 /* The old data of the timer are returned */ if ( ovalue ) 2006024: 80 a6 e0 00 cmp %i3, 0 2006028: 02 80 00 05 be 200603c 200602c: 90 10 00 1b mov %i3, %o0 *ovalue = ptimer->timer_data; 2006030: 92 06 20 54 add %i0, 0x54, %o1 2006034: 40 00 26 a0 call 200fab4 2006038: 94 10 20 10 mov 0x10, %o2 /* The new data are set */ ptimer->timer_data = normalize; 200603c: 90 06 20 54 add %i0, 0x54, %o0 2006040: 92 07 bf e4 add %fp, -28, %o1 2006044: 40 00 26 9c call 200fab4 2006048: 94 10 20 10 mov 0x10, %o2 /* Indicates that the timer is created and stopped */ ptimer->state = POSIX_TIMER_STATE_CREATE_STOP; 200604c: 82 10 20 04 mov 4, %g1 2006050: 10 80 00 1f b 20060cc 2006054: 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 ); 2006058: 40 00 0f 16 call 2009cb0 <_Timespec_To_ticks> 200605c: 90 10 00 1a mov %i2, %o0 2006060: d0 26 20 64 st %o0, [ %i0 + 0x64 ] initial_period = _Timespec_To_ticks( &normalize.it_value ); 2006064: 40 00 0f 13 call 2009cb0 <_Timespec_To_ticks> 2006068: 90 07 bf ec add %fp, -20, %o0 activated = _POSIX_Timer_Insert_helper( 200606c: 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 ); 2006070: 92 10 00 08 mov %o0, %o1 activated = _POSIX_Timer_Insert_helper( 2006074: 17 00 80 18 sethi %hi(0x2006000), %o3 2006078: 90 06 20 10 add %i0, 0x10, %o0 200607c: 96 12 e0 f4 or %o3, 0xf4, %o3 2006080: 40 00 19 8d call 200c6b4 <_POSIX_Timer_Insert_helper> 2006084: 98 10 00 18 mov %i0, %o4 initial_period, ptimer->Object.id, _POSIX_Timer_TSR, ptimer ); if ( !activated ) { 2006088: 80 8a 20 ff btst 0xff, %o0 200608c: 02 80 00 10 be 20060cc 2006090: 01 00 00 00 nop /* * The timer has been started and is running. So we return the * old ones in "ovalue" */ if ( ovalue ) 2006094: 80 a6 e0 00 cmp %i3, 0 2006098: 02 80 00 05 be 20060ac 200609c: 90 10 00 1b mov %i3, %o0 *ovalue = ptimer->timer_data; 20060a0: 92 06 20 54 add %i0, 0x54, %o1 20060a4: 40 00 26 84 call 200fab4 20060a8: 94 10 20 10 mov 0x10, %o2 ptimer->timer_data = normalize; 20060ac: 90 06 20 54 add %i0, 0x54, %o0 20060b0: 92 07 bf e4 add %fp, -28, %o1 20060b4: 40 00 26 80 call 200fab4 20060b8: 94 10 20 10 mov 0x10, %o2 /* Indicate that the time is running */ ptimer->state = POSIX_TIMER_STATE_CREATE_RUN; 20060bc: 82 10 20 03 mov 3, %g1 _TOD_Get( &ptimer->time ); 20060c0: 90 06 20 6c add %i0, 0x6c, %o0 20060c4: 40 00 05 d6 call 200781c <_TOD_Get> 20060c8: c2 2e 20 3c stb %g1, [ %i0 + 0x3c ] _Thread_Enable_dispatch(); 20060cc: 40 00 0b e3 call 2009058 <_Thread_Enable_dispatch> 20060d0: b0 10 20 00 clr %i0 return 0; 20060d4: 81 c7 e0 08 ret 20060d8: 81 e8 00 00 restore #endif case OBJECTS_ERROR: break; } rtems_set_errno_and_return_minus_one( EINVAL ); 20060dc: 40 00 24 21 call 200f160 <__errno> 20060e0: b0 10 3f ff mov -1, %i0 20060e4: 82 10 20 16 mov 0x16, %g1 20060e8: c2 22 00 00 st %g1, [ %o0 ] } 20060ec: 81 c7 e0 08 ret 20060f0: 81 e8 00 00 restore =============================================================================== 02005d88 : useconds_t ualarm( useconds_t useconds, useconds_t interval ) { 2005d88: 9d e3 bf 98 save %sp, -104, %sp /* * Initialize the timer used to implement alarm(). */ if ( !the_timer->routine ) { 2005d8c: 39 00 80 61 sethi %hi(0x2018400), %i4 2005d90: b8 17 22 08 or %i4, 0x208, %i4 ! 2018608 <_POSIX_signals_Ualarm_timer> 2005d94: c2 07 20 1c ld [ %i4 + 0x1c ], %g1 2005d98: 80 a0 60 00 cmp %g1, 0 2005d9c: 12 80 00 0a bne 2005dc4 2005da0: ba 10 00 18 mov %i0, %i5 Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2005da4: 03 00 80 17 sethi %hi(0x2005c00), %g1 Watchdog_Service_routine_entry routine, Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; 2005da8: c0 27 20 08 clr [ %i4 + 8 ] the_watchdog->routine = routine; 2005dac: 82 10 61 5c or %g1, 0x15c, %g1 the_watchdog->id = id; 2005db0: c0 27 20 20 clr [ %i4 + 0x20 ] Objects_Id id, void *user_data ) { the_watchdog->state = WATCHDOG_INACTIVE; the_watchdog->routine = routine; 2005db4: c2 27 20 1c st %g1, [ %i4 + 0x1c ] the_watchdog->id = id; the_watchdog->user_data = user_data; 2005db8: c0 27 20 24 clr [ %i4 + 0x24 ] useconds_t ualarm( useconds_t useconds, useconds_t interval ) { useconds_t remaining = 0; 2005dbc: 10 80 00 1b b 2005e28 2005dc0: 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 ); 2005dc4: 40 00 0f d5 call 2009d18 <_Watchdog_Remove> 2005dc8: 90 10 00 1c mov %i4, %o0 if ( (state == WATCHDOG_ACTIVE) || (state == WATCHDOG_REMOVE_IT) ) { 2005dcc: 90 02 3f fe add %o0, -2, %o0 2005dd0: 80 a2 20 01 cmp %o0, 1 2005dd4: 18 80 00 15 bgu 2005e28 <== NEVER TAKEN 2005dd8: 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); 2005ddc: c2 07 20 0c ld [ %i4 + 0xc ], %g1 2005de0: d0 07 20 14 ld [ %i4 + 0x14 ], %o0 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 2005de4: 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); 2005de8: 90 02 00 01 add %o0, %g1, %o0 2005dec: c2 07 20 18 ld [ %i4 + 0x18 ], %g1 /* remaining is now in ticks */ _Timespec_From_ticks( ticks, &tp ); 2005df0: 40 00 0e 5b call 200975c <_Timespec_From_ticks> 2005df4: 90 22 00 01 sub %o0, %g1, %o0 remaining = tp.tv_sec * TOD_MICROSECONDS_PER_SECOND; 2005df8: c2 07 bf f8 ld [ %fp + -8 ], %g1 remaining += tp.tv_nsec / 1000; 2005dfc: 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; 2005e00: b1 28 60 08 sll %g1, 8, %i0 2005e04: 85 28 60 03 sll %g1, 3, %g2 2005e08: 84 26 00 02 sub %i0, %g2, %g2 remaining += tp.tv_nsec / 1000; 2005e0c: 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; 2005e10: b1 28 a0 06 sll %g2, 6, %i0 2005e14: b0 26 00 02 sub %i0, %g2, %i0 remaining += tp.tv_nsec / 1000; 2005e18: 40 00 37 1c call 2013a88 <.div> 2005e1c: 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; 2005e20: b1 2e 20 06 sll %i0, 6, %i0 remaining += tp.tv_nsec / 1000; 2005e24: 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 ) { 2005e28: 80 a7 60 00 cmp %i5, 0 2005e2c: 02 80 00 19 be 2005e90 2005e30: 39 00 03 d0 sethi %hi(0xf4000), %i4 Watchdog_Interval ticks; tp.tv_sec = useconds / TOD_MICROSECONDS_PER_SECOND; 2005e34: 90 10 00 1d mov %i5, %o0 2005e38: 40 00 37 12 call 2013a80 <.udiv> 2005e3c: 92 17 22 40 or %i4, 0x240, %o1 tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2005e40: 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; 2005e44: d0 27 bf f8 st %o0, [ %fp + -8 ] tp.tv_nsec = (useconds % TOD_MICROSECONDS_PER_SECOND) * 1000; 2005e48: 40 00 37 ba call 2013d30 <.urem> 2005e4c: 90 10 00 1d mov %i5, %o0 2005e50: 85 2a 20 07 sll %o0, 7, %g2 2005e54: 83 2a 20 02 sll %o0, 2, %g1 2005e58: 82 20 80 01 sub %g2, %g1, %g1 2005e5c: 90 00 40 08 add %g1, %o0, %o0 2005e60: 91 2a 20 03 sll %o0, 3, %o0 2005e64: d0 27 bf fc st %o0, [ %fp + -4 ] ticks = _Timespec_To_ticks( &tp ); 2005e68: 40 00 0e 63 call 20097f4 <_Timespec_To_ticks> 2005e6c: 90 07 bf f8 add %fp, -8, %o0 if ( ticks == 0 ) ticks = 1; _Watchdog_Insert_ticks( the_timer, _Timespec_To_ticks( &tp ) ); 2005e70: 40 00 0e 61 call 20097f4 <_Timespec_To_ticks> 2005e74: 90 07 bf f8 add %fp, -8, %o0 Watchdog_Control *the_watchdog, Watchdog_Interval units ) { the_watchdog->initial = units; 2005e78: 13 00 80 61 sethi %hi(0x2018400), %o1 2005e7c: 92 12 62 08 or %o1, 0x208, %o1 ! 2018608 <_POSIX_signals_Ualarm_timer> 2005e80: d0 22 60 0c st %o0, [ %o1 + 0xc ] _Watchdog_Insert( &_Watchdog_Ticks_chain, the_watchdog ); 2005e84: 11 00 80 5f sethi %hi(0x2017c00), %o0 2005e88: 40 00 0f 4a call 2009bb0 <_Watchdog_Insert> 2005e8c: 90 12 21 c4 or %o0, 0x1c4, %o0 ! 2017dc4 <_Watchdog_Ticks_chain> } return remaining; } 2005e90: 81 c7 e0 08 ret 2005e94: 81 e8 00 00 restore